mirror of
https://github.com/amd/blis.git
synced 2026-04-20 07:38:53 +00:00
e9da6425e2
Details: - Fixed a bug that broke the use of 1m for dcomplex when the single- precision real and double-precision real ukernels had opposing I/O preferences (row-preferential sgemm ukernel + column-preferential dgemm ukernel, or vice versa). The fix involved adjusting the API to bli_cntx_set_ind_blkszs() so that the induced method context init function (e.g., bli_cntx_init_<subconfig>_ind()) could call that function for only one datatype at a time. This allowed the blocksize scaling (which varies depending on whether we're doing 1m_r or 1m_c) to happen on a per-datatype basis. This fixes issue #557. Thanks to Devin Matthews and RuQing Xu for helping discover and report this bug. - The aforementioned 1m fix required moving the 1m_r/1m_c logic from bli_cntx_ref.c into a new function, bli_l3_set_schemas(), which is called from each level-3 _front() function. The pack_t schemas in the cntx_t were also removed entirely, along with the associated accessor functions. This in turn required updating the trsm1m-related virtual ukernels to read the pack schema for B from the auxinfo_t struct rather than the context. This also required slight tweaks to bli_gemm_md.c. - Repositioned the logic for transposing the operation to accommodate the microkernel IO preference. This mostly only affects gemm. Thanks to Devin Matthews for his help with this. - Updated dpackm pack ukernels in the 'armsve' kernel set to avoid querying pack_t schemas from the context. - Removed the num_t dt argument from the ind_cntx_init_ft type defined in bli_gks.c. The context initialization functions for induced methods were previously passed a dt argument, but I can no longer figure out *why* they were passed this value. To reduce confusion, I've removed the dt argument (including also from the function defintion + prototype). - Commented out setting of cntx_t schemas in bli_cntx_ind_stage.c. This breaks high-leve implementations of 3m and 4m, but this is okay since those implementations will be removed very soon. - Removed some older blocks of preprocessor-disabled code. - Comment update to test_libblis.c.
701 lines
19 KiB
C
701 lines
19 KiB
C
/*
|
|
|
|
BLIS
|
|
An object-based framework for developing high-performance BLAS-like
|
|
libraries.
|
|
|
|
Copyright (C) 2014, The University of Texas at Austin
|
|
Copyright (C) 2018 - 2019, 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.
|
|
|
|
*/
|
|
|
|
#include "blis.h"
|
|
#include "test_libblis.h"
|
|
|
|
|
|
// Static variables.
|
|
static char* op_str = "gemm";
|
|
static char* o_types = "mmm"; // a b c
|
|
static char* p_types = "hh"; // transa transb
|
|
static thresh_t thresh[BLIS_NUM_FP_TYPES] = { { 1e-04, 1e-05 }, // warn, pass for s
|
|
{ 1e-04, 1e-05 }, // warn, pass for c
|
|
{ 1e-13, 1e-14 }, // warn, pass for d
|
|
{ 1e-13, 1e-14 } }; // warn, pass for z
|
|
|
|
// Local prototypes.
|
|
void libblis_test_gemm_deps
|
|
(
|
|
thread_data_t* tdata,
|
|
test_params_t* params,
|
|
test_op_t* op
|
|
);
|
|
|
|
void libblis_test_gemm_experiment
|
|
(
|
|
test_params_t* params,
|
|
test_op_t* op,
|
|
iface_t iface,
|
|
char* dc_str,
|
|
char* pc_str,
|
|
char* sc_str,
|
|
unsigned int p_cur,
|
|
double* perf,
|
|
double* resid
|
|
);
|
|
|
|
void libblis_test_gemm_md
|
|
(
|
|
test_params_t* params,
|
|
test_op_t* op,
|
|
iface_t iface,
|
|
char* dc_str,
|
|
char* pc_str,
|
|
char* sc_str,
|
|
unsigned int p_cur,
|
|
double* perf,
|
|
double* resid
|
|
);
|
|
|
|
void libblis_test_gemm_impl
|
|
(
|
|
iface_t iface,
|
|
obj_t* alpha,
|
|
obj_t* a,
|
|
obj_t* b,
|
|
obj_t* beta,
|
|
obj_t* c
|
|
);
|
|
|
|
void libblis_test_gemm_check
|
|
(
|
|
test_params_t* params,
|
|
obj_t* alpha,
|
|
obj_t* a,
|
|
obj_t* b,
|
|
obj_t* beta,
|
|
obj_t* c,
|
|
obj_t* c_orig,
|
|
double* resid
|
|
);
|
|
|
|
void libblis_test_gemm_md_check
|
|
(
|
|
test_params_t* params,
|
|
obj_t* alpha,
|
|
obj_t* a,
|
|
obj_t* b,
|
|
obj_t* beta,
|
|
obj_t* c,
|
|
obj_t* c_orig,
|
|
double* resid
|
|
);
|
|
|
|
double libblis_test_gemm_flops
|
|
(
|
|
obj_t* a,
|
|
obj_t* b,
|
|
obj_t* c
|
|
);
|
|
|
|
|
|
void libblis_test_gemm_deps
|
|
(
|
|
thread_data_t* tdata,
|
|
test_params_t* params,
|
|
test_op_t* op
|
|
)
|
|
{
|
|
libblis_test_randv( tdata, params, &(op->ops->randv) );
|
|
libblis_test_randm( tdata, params, &(op->ops->randm) );
|
|
libblis_test_setv( tdata, params, &(op->ops->setv) );
|
|
libblis_test_normfv( tdata, params, &(op->ops->normfv) );
|
|
libblis_test_subv( tdata, params, &(op->ops->subv) );
|
|
libblis_test_scalv( tdata, params, &(op->ops->scalv) );
|
|
libblis_test_copym( tdata, params, &(op->ops->copym) );
|
|
libblis_test_scalm( tdata, params, &(op->ops->scalm) );
|
|
libblis_test_gemv( tdata, params, &(op->ops->gemv) );
|
|
}
|
|
|
|
|
|
|
|
void libblis_test_gemm
|
|
(
|
|
thread_data_t* tdata,
|
|
test_params_t* params,
|
|
test_op_t* op
|
|
)
|
|
{
|
|
|
|
// Return early if this test has already been done.
|
|
if ( libblis_test_op_is_done( op ) ) return;
|
|
|
|
// Return early if operation is disabled.
|
|
if ( libblis_test_op_is_disabled( op ) ||
|
|
libblis_test_l3_is_disabled( op ) ) return;
|
|
|
|
// Call dependencies first.
|
|
if ( TRUE ) libblis_test_gemm_deps( tdata, params, op );
|
|
|
|
// Execute the test driver for each implementation requested.
|
|
//if ( op->front_seq == ENABLE )
|
|
{
|
|
libblis_test_op_driver( tdata,
|
|
params,
|
|
op,
|
|
BLIS_TEST_SEQ_FRONT_END,
|
|
op_str,
|
|
p_types,
|
|
o_types,
|
|
thresh,
|
|
libblis_test_gemm_experiment );
|
|
}
|
|
}
|
|
|
|
|
|
|
|
void libblis_test_gemm_experiment
|
|
(
|
|
test_params_t* params,
|
|
test_op_t* op,
|
|
iface_t iface,
|
|
char* dc_str,
|
|
char* pc_str,
|
|
char* sc_str,
|
|
unsigned int p_cur,
|
|
double* perf,
|
|
double* resid
|
|
)
|
|
{
|
|
unsigned int n_repeats = params->n_repeats;
|
|
unsigned int i;
|
|
|
|
double time_min = DBL_MAX;
|
|
double time;
|
|
|
|
num_t datatype;
|
|
|
|
dim_t m, n, k;
|
|
|
|
trans_t transa;
|
|
trans_t transb;
|
|
|
|
obj_t alpha, a, b, beta, c;
|
|
obj_t c_save;
|
|
|
|
|
|
// Use a different function to handle mixed datatypes.
|
|
if ( params->mixed_domain || params->mixed_precision )
|
|
{
|
|
libblis_test_gemm_md( params, op, iface,
|
|
dc_str, pc_str, sc_str,
|
|
p_cur, perf, resid );
|
|
return;
|
|
}
|
|
|
|
// Use the datatype of the first char in the datatype combination string.
|
|
bli_param_map_char_to_blis_dt( dc_str[0], &datatype );
|
|
|
|
// Map the dimension specifier to actual dimensions.
|
|
m = libblis_test_get_dim_from_prob_size( op->dim_spec[0], p_cur );
|
|
n = libblis_test_get_dim_from_prob_size( op->dim_spec[1], p_cur );
|
|
k = libblis_test_get_dim_from_prob_size( op->dim_spec[2], p_cur );
|
|
|
|
// Map parameter characters to BLIS constants.
|
|
bli_param_map_char_to_blis_trans( pc_str[0], &transa );
|
|
bli_param_map_char_to_blis_trans( pc_str[1], &transb );
|
|
|
|
// Create test scalars.
|
|
bli_obj_scalar_init_detached( datatype, &alpha );
|
|
bli_obj_scalar_init_detached( datatype, &beta );
|
|
|
|
// Create test operands (vectors and/or matrices).
|
|
libblis_test_mobj_create( params, datatype, transa,
|
|
sc_str[1], m, k, &a );
|
|
libblis_test_mobj_create( params, datatype, transb,
|
|
sc_str[2], k, n, &b );
|
|
libblis_test_mobj_create( params, datatype, BLIS_NO_TRANSPOSE,
|
|
sc_str[0], m, n, &c );
|
|
libblis_test_mobj_create( params, datatype, BLIS_NO_TRANSPOSE,
|
|
sc_str[0], m, n, &c_save );
|
|
|
|
// Set alpha and beta.
|
|
if ( bli_obj_is_real( &c ) )
|
|
{
|
|
bli_setsc( 1.2, 0.0, &alpha );
|
|
bli_setsc( 0.9, 0.0, &beta );
|
|
}
|
|
else
|
|
{
|
|
bli_setsc( 1.2, 0.8, &alpha );
|
|
bli_setsc( 0.9, 1.0, &beta );
|
|
}
|
|
|
|
#if 0
|
|
//bli_setm( &BLIS_ONE, &a );
|
|
bli_setsc( 1.0, 0.0, &alpha );
|
|
bli_setsc( 1.0, 0.0, &beta );
|
|
#endif
|
|
|
|
// Randomize A, B, and C, and save C.
|
|
libblis_test_mobj_randomize( params, TRUE, &a );
|
|
libblis_test_mobj_randomize( params, TRUE, &b );
|
|
libblis_test_mobj_randomize( params, TRUE, &c );
|
|
bli_copym( &c, &c_save );
|
|
|
|
// Apply the parameters.
|
|
bli_obj_set_conjtrans( transa, &a );
|
|
bli_obj_set_conjtrans( transb, &b );
|
|
|
|
// Repeat the experiment n_repeats times and record results.
|
|
for ( i = 0; i < n_repeats; ++i )
|
|
{
|
|
bli_copym( &c_save, &c );
|
|
|
|
time = bli_clock();
|
|
|
|
libblis_test_gemm_impl( iface, &alpha, &a, &b, &beta, &c );
|
|
|
|
time_min = bli_clock_min_diff( time_min, time );
|
|
}
|
|
|
|
// Estimate the performance of the best experiment repeat.
|
|
*perf = ( 2.0 * m * n * k ) / time_min / FLOPS_PER_UNIT_PERF;
|
|
if ( bli_obj_is_complex( &c ) ) *perf *= 4.0;
|
|
|
|
// Perform checks.
|
|
libblis_test_gemm_check( params, &alpha, &a, &b, &beta, &c, &c_save, resid );
|
|
|
|
// Zero out performance and residual if output matrix is empty.
|
|
libblis_test_check_empty_problem( &c, perf, resid );
|
|
|
|
// Free the test objects.
|
|
bli_obj_free( &a );
|
|
bli_obj_free( &b );
|
|
bli_obj_free( &c );
|
|
bli_obj_free( &c_save );
|
|
}
|
|
|
|
|
|
void libblis_test_gemm_md
|
|
(
|
|
test_params_t* params,
|
|
test_op_t* op,
|
|
iface_t iface,
|
|
char* dc_str,
|
|
char* pc_str,
|
|
char* sc_str,
|
|
unsigned int p_cur,
|
|
double* perf,
|
|
double* resid
|
|
)
|
|
{
|
|
unsigned int n_repeats = params->n_repeats;
|
|
unsigned int i;
|
|
|
|
double time_min = DBL_MAX;
|
|
double time;
|
|
|
|
num_t dt_a, dt_b, dt_c;
|
|
num_t dt_complex;
|
|
|
|
dim_t m, n, k;
|
|
|
|
trans_t transa;
|
|
trans_t transb;
|
|
|
|
obj_t alpha, a, b, beta, c;
|
|
obj_t c_save;
|
|
|
|
|
|
// Decode the datatype combination string.
|
|
bli_param_map_char_to_blis_dt( dc_str[0], &dt_c );
|
|
bli_param_map_char_to_blis_dt( dc_str[1], &dt_a );
|
|
bli_param_map_char_to_blis_dt( dc_str[2], &dt_b );
|
|
|
|
// Project one of the datatypes (it doesn't matter which) to the
|
|
// complex domain.
|
|
dt_complex = bli_dt_proj_to_complex( dt_c );
|
|
|
|
// Map the dimension specifier to actual dimensions.
|
|
m = libblis_test_get_dim_from_prob_size( op->dim_spec[0], p_cur );
|
|
n = libblis_test_get_dim_from_prob_size( op->dim_spec[1], p_cur );
|
|
k = libblis_test_get_dim_from_prob_size( op->dim_spec[2], p_cur );
|
|
|
|
// Map parameter characters to BLIS constants.
|
|
bli_param_map_char_to_blis_trans( pc_str[0], &transa );
|
|
bli_param_map_char_to_blis_trans( pc_str[1], &transb );
|
|
|
|
// Create test scalars.
|
|
bli_obj_scalar_init_detached( dt_complex, &alpha );
|
|
bli_obj_scalar_init_detached( dt_complex, &beta );
|
|
|
|
// Create test operands (vectors and/or matrices).
|
|
libblis_test_mobj_create( params, dt_a, transa,
|
|
sc_str[1], m, k, &a );
|
|
libblis_test_mobj_create( params, dt_b, transb,
|
|
sc_str[2], k, n, &b );
|
|
libblis_test_mobj_create( params, dt_c, BLIS_NO_TRANSPOSE,
|
|
sc_str[0], m, n, &c );
|
|
libblis_test_mobj_create( params, dt_c, BLIS_NO_TRANSPOSE,
|
|
sc_str[0], m, n, &c_save );
|
|
|
|
// For mixed-precision, set the computation precision of C.
|
|
if ( params->mixed_precision )
|
|
{
|
|
num_t dt_comp;
|
|
prec_t comp_prec;
|
|
|
|
// The computation precision is encoded in the computation datatype,
|
|
// which appears as an additional char in dc_str.
|
|
bli_param_map_char_to_blis_dt( dc_str[3], &dt_comp );
|
|
|
|
// Extract the precision from the computation datatype.
|
|
comp_prec = bli_dt_prec( dt_comp );
|
|
|
|
// Set the computation precision of C.
|
|
bli_obj_set_comp_prec( comp_prec, &c );
|
|
}
|
|
|
|
|
|
// Set alpha and beta.
|
|
{
|
|
bli_setsc( 2.0, 0.0, &alpha );
|
|
bli_setsc( 1.2, 0.5, &beta );
|
|
//bli_setsc( 1.0, 0.0, &alpha );
|
|
//bli_setsc( 1.0, 0.0, &beta );
|
|
}
|
|
|
|
// Randomize A, B, and C, and save C.
|
|
libblis_test_mobj_randomize( params, TRUE, &a );
|
|
libblis_test_mobj_randomize( params, TRUE, &b );
|
|
libblis_test_mobj_randomize( params, TRUE, &c );
|
|
bli_copym( &c, &c_save );
|
|
|
|
// Apply the parameters.
|
|
bli_obj_set_conjtrans( transa, &a );
|
|
bli_obj_set_conjtrans( transb, &b );
|
|
|
|
// Repeat the experiment n_repeats times and record results.
|
|
for ( i = 0; i < n_repeats; ++i )
|
|
{
|
|
bli_copym( &c_save, &c );
|
|
|
|
time = bli_clock();
|
|
|
|
libblis_test_gemm_impl( iface, &alpha, &a, &b, &beta, &c );
|
|
|
|
time_min = bli_clock_min_diff( time_min, time );
|
|
}
|
|
|
|
// Estimate the performance of the best experiment repeat.
|
|
//*perf = ( 2.0 * m * n * k ) / time_min / FLOPS_PER_UNIT_PERF;
|
|
//if ( bli_obj_is_complex( &c ) ) *perf *= 4.0;
|
|
*perf = libblis_test_gemm_flops( &a, &b, &c ) / time_min / FLOPS_PER_UNIT_PERF;
|
|
|
|
// Perform checks.
|
|
libblis_test_gemm_md_check( params, &alpha, &a, &b, &beta, &c, &c_save, resid );
|
|
|
|
// Zero out performance and residual if output matrix is empty.
|
|
libblis_test_check_empty_problem( &c, perf, resid );
|
|
|
|
// Free the test objects.
|
|
bli_obj_free( &a );
|
|
bli_obj_free( &b );
|
|
bli_obj_free( &c );
|
|
bli_obj_free( &c_save );
|
|
}
|
|
|
|
|
|
|
|
void libblis_test_gemm_impl
|
|
(
|
|
iface_t iface,
|
|
obj_t* alpha,
|
|
obj_t* a,
|
|
obj_t* b,
|
|
obj_t* beta,
|
|
obj_t* c
|
|
)
|
|
{
|
|
switch ( iface )
|
|
{
|
|
case BLIS_TEST_SEQ_FRONT_END:
|
|
#if 0
|
|
//bli_printm( "alpha", alpha, "%5.2f", "" );
|
|
//bli_printm( "beta", beta, "%5.2f", "" );
|
|
if ( bli_obj_dt( c ) == BLIS_DCOMPLEX )
|
|
{
|
|
bli_printm( "a", a, "%5.2f", "" );
|
|
bli_printm( "b", b, "%5.2f", "" );
|
|
bli_printm( "c", c, "%5.2f", "" );
|
|
}
|
|
#endif
|
|
//if ( bli_obj_length( b ) == 16 &&
|
|
// bli_obj_stor3_from_strides( c, a, b ) == BLIS_CRR )
|
|
//bli_printm( "c before", c, "%6.3f", "" );
|
|
bli_gemm( alpha, a, b, beta, c );
|
|
//bls_gemm( alpha, a, b, beta, c );
|
|
#if 0
|
|
if ( bli_obj_dt( c ) == BLIS_DCOMPLEX )
|
|
bli_printm( "c after", c, "%6.3f", "" );
|
|
#endif
|
|
//bli_printm( "c after", c, "%5.2f", "" );
|
|
break;
|
|
|
|
default:
|
|
libblis_test_printf_error( "Invalid interface type.\n" );
|
|
}
|
|
}
|
|
|
|
|
|
|
|
void libblis_test_gemm_md_check
|
|
(
|
|
test_params_t* params,
|
|
obj_t* alpha,
|
|
obj_t* a,
|
|
obj_t* b,
|
|
obj_t* beta,
|
|
obj_t* c,
|
|
obj_t* c_orig,
|
|
double* resid
|
|
)
|
|
{
|
|
num_t dt_real = bli_obj_dt_proj_to_real( c );
|
|
num_t dt_comp = bli_obj_dt_proj_to_complex( c );
|
|
num_t dt;
|
|
|
|
dim_t m = bli_obj_length( c );
|
|
dim_t n = bli_obj_width( c );
|
|
dim_t k = bli_obj_width_after_trans( a );
|
|
|
|
obj_t norm;
|
|
obj_t t, v, w, z;
|
|
|
|
double junk;
|
|
|
|
// Compute our reference checksum in the real domain if all operands
|
|
// are real, and in the complex domain otherwise. Also implicit in this
|
|
// is that we use the storage precision of C to determine the precision
|
|
// in which we perform the reference checksum.
|
|
if ( bli_obj_is_real( a ) &&
|
|
bli_obj_is_real( b ) &&
|
|
bli_obj_is_real( c ) ) dt = dt_real;
|
|
else dt = dt_comp;
|
|
|
|
// This function works in a manner similar to that of the function
|
|
// libblis_test_gemm_check(), except that we project a, b, and c into
|
|
// the complex domain (regardless of their storage datatype), and then
|
|
// proceed with the checking accordingly.
|
|
|
|
obj_t a2, b2, c2, c0;
|
|
|
|
bli_obj_scalar_init_detached( dt_real, &norm );
|
|
|
|
bli_obj_create( dt, n, 1, 0, 0, &t );
|
|
bli_obj_create( dt, m, 1, 0, 0, &v );
|
|
bli_obj_create( dt, k, 1, 0, 0, &w );
|
|
bli_obj_create( dt, m, 1, 0, 0, &z );
|
|
|
|
libblis_test_vobj_randomize( params, TRUE, &t );
|
|
|
|
// We need to zero out the imaginary part of t in order for our
|
|
// checks to work in all cases. Otherwise, the imaginary parts
|
|
// could affect intermediate products, depending on the order that
|
|
// they are executed.
|
|
bli_setiv( &BLIS_ZERO, &t );
|
|
|
|
// Create complex equivalents of a, b, c_orig, and c.
|
|
bli_obj_create( dt, m, k, 0, 0, &a2 );
|
|
bli_obj_create( dt, k, n, 0, 0, &b2 );
|
|
bli_obj_create( dt, m, n, 0, 0, &c2 );
|
|
bli_obj_create( dt, m, n, 0, 0, &c0 );
|
|
|
|
// Cast a, b, c_orig, and c into the datatype of our temporary objects.
|
|
bli_castm( a, &a2 );
|
|
bli_castm( b, &b2 );
|
|
bli_castm( c_orig, &c2 );
|
|
bli_castm( c, &c0 );
|
|
|
|
bli_gemv( &BLIS_ONE, &c0, &t, &BLIS_ZERO, &v );
|
|
|
|
#if 0
|
|
if ( bli_obj_is_scomplex( c ) &&
|
|
bli_obj_is_float( a ) &&
|
|
bli_obj_is_float( b ) )
|
|
{
|
|
bli_printm( "test_gemm.c: a", a, "%7.3f", "" );
|
|
bli_printm( "test_gemm.c: b", b, "%7.3f", "" );
|
|
bli_printm( "test_gemm.c: c orig", c_orig, "%7.3f", "" );
|
|
bli_printm( "test_gemm.c: c computed", c, "%7.3f", "" );
|
|
}
|
|
#endif
|
|
|
|
#if 0
|
|
bli_gemm( alpha, &a2, &b2, beta, &c2 );
|
|
bli_gemv( &BLIS_ONE, &c2, &t, &BLIS_ZERO, &z );
|
|
if ( bli_obj_is_real( c ) ) bli_setiv( &BLIS_ZERO, &z );
|
|
#else
|
|
bli_gemv( &BLIS_ONE, &b2, &t, &BLIS_ZERO, &w );
|
|
bli_gemv( alpha, &a2, &w, &BLIS_ZERO, &z );
|
|
bli_gemv( beta, &c2, &t, &BLIS_ONE, &z );
|
|
if ( bli_obj_is_real( c ) ) bli_setiv( &BLIS_ZERO, &z );
|
|
#endif
|
|
|
|
bli_subv( &z, &v );
|
|
bli_normfv( &v, &norm );
|
|
bli_getsc( &norm, resid, &junk );
|
|
|
|
bli_obj_free( &t );
|
|
bli_obj_free( &v );
|
|
bli_obj_free( &w );
|
|
bli_obj_free( &z );
|
|
|
|
bli_obj_free( &a2 );
|
|
bli_obj_free( &b2 );
|
|
bli_obj_free( &c2 );
|
|
bli_obj_free( &c0 );
|
|
}
|
|
|
|
|
|
|
|
void libblis_test_gemm_check
|
|
(
|
|
test_params_t* params,
|
|
obj_t* alpha,
|
|
obj_t* a,
|
|
obj_t* b,
|
|
obj_t* beta,
|
|
obj_t* c,
|
|
obj_t* c_orig,
|
|
double* resid
|
|
)
|
|
{
|
|
num_t dt = bli_obj_dt( c );
|
|
num_t dt_real = bli_obj_dt_proj_to_real( c );
|
|
|
|
dim_t m = bli_obj_length( c );
|
|
dim_t n = bli_obj_width( c );
|
|
dim_t k = bli_obj_width_after_trans( a );
|
|
|
|
obj_t norm;
|
|
obj_t t, v, w, z;
|
|
|
|
double junk;
|
|
|
|
//
|
|
// Pre-conditions:
|
|
// - a is randomized.
|
|
// - b is randomized.
|
|
// - c_orig is randomized.
|
|
// Note:
|
|
// - alpha and beta should have non-zero imaginary components in the
|
|
// complex cases in order to more fully exercise the implementation.
|
|
//
|
|
// Under these conditions, we assume that the implementation for
|
|
//
|
|
// C := beta * C_orig + alpha * transa(A) * transb(B)
|
|
//
|
|
// is functioning correctly if
|
|
//
|
|
// normfv( v - z )
|
|
//
|
|
// is negligible, where
|
|
//
|
|
// v = C * t
|
|
// z = ( beta * C_orig + alpha * transa(A) * transb(B) ) * t
|
|
// = beta * C_orig * t + alpha * transa(A) * transb(B) * t
|
|
// = beta * C_orig * t + alpha * transa(A) * w
|
|
// = beta * C_orig * t + z
|
|
//
|
|
|
|
bli_obj_scalar_init_detached( dt_real, &norm );
|
|
|
|
bli_obj_create( dt, n, 1, 0, 0, &t );
|
|
bli_obj_create( dt, m, 1, 0, 0, &v );
|
|
bli_obj_create( dt, k, 1, 0, 0, &w );
|
|
bli_obj_create( dt, m, 1, 0, 0, &z );
|
|
|
|
libblis_test_vobj_randomize( params, TRUE, &t );
|
|
|
|
bli_gemv( &BLIS_ONE, c, &t, &BLIS_ZERO, &v );
|
|
|
|
bli_gemv( &BLIS_ONE, b, &t, &BLIS_ZERO, &w );
|
|
bli_gemv( alpha, a, &w, &BLIS_ZERO, &z );
|
|
bli_gemv( beta, c_orig, &t, &BLIS_ONE, &z );
|
|
|
|
bli_subv( &z, &v );
|
|
bli_normfv( &v, &norm );
|
|
bli_getsc( &norm, resid, &junk );
|
|
|
|
bli_obj_free( &t );
|
|
bli_obj_free( &v );
|
|
bli_obj_free( &w );
|
|
bli_obj_free( &z );
|
|
}
|
|
|
|
double libblis_test_gemm_flops
|
|
(
|
|
obj_t* a,
|
|
obj_t* b,
|
|
obj_t* c
|
|
)
|
|
{
|
|
bool a_is_real = bli_obj_is_real( a );
|
|
bool a_is_complex = bli_obj_is_complex( a );
|
|
|
|
bool b_is_real = bli_obj_is_real( b );
|
|
bool b_is_complex = bli_obj_is_complex( b );
|
|
|
|
bool c_is_real = bli_obj_is_real( c );
|
|
bool c_is_complex = bli_obj_is_complex( c );
|
|
|
|
double m = ( double )bli_obj_length( c );
|
|
double n = ( double )bli_obj_width( c );
|
|
double k = ( double )bli_obj_width( a );
|
|
|
|
double flops;
|
|
|
|
if ( ( c_is_complex && a_is_complex && b_is_complex ) )
|
|
{
|
|
flops = 8.0 * m * n * k;
|
|
}
|
|
else if ( ( c_is_complex && a_is_complex && b_is_real ) ||
|
|
( c_is_complex && a_is_real && b_is_complex ) ||
|
|
( c_is_real && a_is_complex && b_is_complex ) )
|
|
{
|
|
flops = 4.0 * m * n * k;
|
|
}
|
|
else
|
|
{
|
|
flops = 2.0 * m * n * k;
|
|
}
|
|
|
|
return flops;
|
|
}
|
|
|