mirror of
https://github.com/amd/blis.git
synced 2026-05-12 18:15:37 +00:00
Details: - Relaxed the base pointer and leading dimension alignment restrictions in the sandybridge gemm microkernels, allowing the use of vmovups/vmovupd instead of vmovaps/vmovapd. These change mimic those made to the haswell microkernels ine0d2fa0andee2c139. - Updated testsuite modules as well as standalone test drivers in 'test' directory to use DBL_MAX as the initial time candidate. Thanks to Devin Matthews for suggesting this change. - Inserted #include "float.h" into bli_system.h (to gain access to DBL_MAX). - Minor update (vis-a-vis contexts) to driver code in test/3m4m.
391 lines
11 KiB
C
391 lines
11 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 at Austin 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 = "symm";
|
|
static char* o_types = "mmm"; // a b c
|
|
static char* p_types = "such"; // side uploa conja 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_symm_deps
|
|
(
|
|
test_params_t* params,
|
|
test_op_t* op
|
|
);
|
|
|
|
void libblis_test_symm_experiment
|
|
(
|
|
test_params_t* params,
|
|
test_op_t* op,
|
|
iface_t iface,
|
|
num_t datatype,
|
|
char* pc_str,
|
|
char* sc_str,
|
|
unsigned int p_cur,
|
|
double* perf,
|
|
double* resid
|
|
);
|
|
|
|
void libblis_test_symm_impl
|
|
(
|
|
iface_t iface,
|
|
side_t side,
|
|
obj_t* alpha,
|
|
obj_t* a,
|
|
obj_t* b,
|
|
obj_t* beta,
|
|
obj_t* c
|
|
);
|
|
|
|
void libblis_test_symm_check
|
|
(
|
|
test_params_t* params,
|
|
side_t side,
|
|
obj_t* alpha,
|
|
obj_t* a,
|
|
obj_t* b,
|
|
obj_t* beta,
|
|
obj_t* c,
|
|
obj_t* c_orig,
|
|
double* resid
|
|
);
|
|
|
|
|
|
|
|
void libblis_test_symm_deps
|
|
(
|
|
test_params_t* params,
|
|
test_op_t* op
|
|
)
|
|
{
|
|
libblis_test_randv( params, &(op->ops->randv) );
|
|
libblis_test_randm( params, &(op->ops->randm) );
|
|
libblis_test_setv( params, &(op->ops->setv) );
|
|
libblis_test_normfv( params, &(op->ops->normfv) );
|
|
libblis_test_subv( params, &(op->ops->subv) );
|
|
libblis_test_scalv( params, &(op->ops->scalv) );
|
|
libblis_test_copym( params, &(op->ops->copym) );
|
|
libblis_test_scalm( params, &(op->ops->scalm) );
|
|
libblis_test_gemv( params, &(op->ops->gemv) );
|
|
libblis_test_symv( params, &(op->ops->symv) );
|
|
}
|
|
|
|
|
|
|
|
void libblis_test_symm
|
|
(
|
|
test_params_t* params,
|
|
test_op_t* op
|
|
)
|
|
{
|
|
|
|
// Return early if this test has already been done.
|
|
if ( op->test_done == TRUE ) return;
|
|
|
|
// Return early if operation is disabled.
|
|
if ( op->op_switch == DISABLE_ALL ||
|
|
op->ops->l3_over == DISABLE_ALL ) return;
|
|
|
|
// Call dependencies first.
|
|
if ( TRUE ) libblis_test_symm_deps( params, op );
|
|
|
|
// Execute the test driver for each implementation requested.
|
|
if ( op->front_seq == ENABLE )
|
|
{
|
|
libblis_test_op_driver( params,
|
|
op,
|
|
BLIS_TEST_SEQ_FRONT_END,
|
|
op_str,
|
|
p_types,
|
|
o_types,
|
|
thresh,
|
|
libblis_test_symm_experiment );
|
|
}
|
|
}
|
|
|
|
|
|
|
|
void libblis_test_symm_experiment
|
|
(
|
|
test_params_t* params,
|
|
test_op_t* op,
|
|
iface_t iface,
|
|
num_t datatype,
|
|
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;
|
|
|
|
dim_t m, n;
|
|
dim_t mn_side;
|
|
|
|
side_t side;
|
|
uplo_t uploa;
|
|
conj_t conja;
|
|
trans_t transb;
|
|
|
|
obj_t alpha, a, b, beta, c;
|
|
obj_t c_save;
|
|
|
|
|
|
// 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 );
|
|
|
|
// Map parameter characters to BLIS constants.
|
|
bli_param_map_char_to_blis_side( pc_str[0], &side );
|
|
bli_param_map_char_to_blis_uplo( pc_str[1], &uploa );
|
|
bli_param_map_char_to_blis_conj( pc_str[2], &conja );
|
|
bli_param_map_char_to_blis_trans( pc_str[3], &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).
|
|
bli_set_dim_with_side( side, m, n, mn_side );
|
|
libblis_test_mobj_create( params, datatype, BLIS_NO_TRANSPOSE,
|
|
sc_str[0], mn_side, mn_side, &a );
|
|
libblis_test_mobj_create( params, datatype, transb,
|
|
sc_str[1], m, n, &b );
|
|
libblis_test_mobj_create( params, datatype, BLIS_NO_TRANSPOSE,
|
|
sc_str[2], m, n, &c );
|
|
libblis_test_mobj_create( params, datatype, BLIS_NO_TRANSPOSE,
|
|
sc_str[2], m, n, &c_save );
|
|
|
|
// Set alpha and beta.
|
|
if ( bli_obj_is_real( c ) )
|
|
{
|
|
bli_setsc( 0.8, 0.0, &alpha );
|
|
bli_setsc( -1.0, 0.0, &beta );
|
|
}
|
|
else
|
|
{
|
|
bli_setsc( 0.8, 0.6, &alpha );
|
|
bli_setsc( -1.0, 1.0, &beta );
|
|
}
|
|
|
|
// Set the structure and uplo properties of A.
|
|
bli_obj_set_struc( BLIS_SYMMETRIC, a );
|
|
bli_obj_set_uplo( uploa, a );
|
|
|
|
// Randomize A, make it densely symmetric, and zero the unstored triangle
|
|
// to ensure the implementation reads only from the stored region.
|
|
libblis_test_mobj_randomize( params, TRUE, &a );
|
|
bli_mksymm( &a );
|
|
bli_mktrim( &a );
|
|
|
|
// Randomize B and C, and save C.
|
|
libblis_test_mobj_randomize( params, TRUE, &b );
|
|
libblis_test_mobj_randomize( params, TRUE, &c );
|
|
bli_copym( &c, &c_save );
|
|
|
|
// Apply the remaining parameters.
|
|
bli_obj_set_conj( conja, 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_symm_impl( iface, side, &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 * mn_side * m * n ) / time_min / FLOPS_PER_UNIT_PERF;
|
|
if ( bli_obj_is_complex( c ) ) *perf *= 4.0;
|
|
|
|
// Perform checks.
|
|
libblis_test_symm_check( params, side, &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_symm_impl
|
|
(
|
|
iface_t iface,
|
|
side_t side,
|
|
obj_t* alpha,
|
|
obj_t* a,
|
|
obj_t* b,
|
|
obj_t* beta,
|
|
obj_t* c
|
|
)
|
|
{
|
|
switch ( iface )
|
|
{
|
|
case BLIS_TEST_SEQ_FRONT_END:
|
|
bli_symm( side, alpha, a, b, beta, c );
|
|
//bli_symm4m( side, alpha, a, b, beta, c );
|
|
//bli_symm3m( side, alpha, a, b, beta, c );
|
|
break;
|
|
|
|
default:
|
|
libblis_test_printf_error( "Invalid interface type.\n" );
|
|
}
|
|
}
|
|
|
|
|
|
|
|
void libblis_test_symm_check
|
|
(
|
|
test_params_t* params,
|
|
side_t side,
|
|
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_datatype( *c );
|
|
num_t dt_real = bli_obj_datatype_proj_to_real( *c );
|
|
|
|
dim_t m = bli_obj_length( *c );
|
|
dim_t n = bli_obj_width( *c );
|
|
|
|
obj_t norm;
|
|
obj_t t, v, w, z;
|
|
|
|
double junk;
|
|
|
|
//
|
|
// Pre-conditions:
|
|
// - a is randomized and symmetric.
|
|
// - 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 * conja(A) * transb(B) (side = left)
|
|
// C := beta * C_orig + alpha * transb(B) * conja(A) (side = right)
|
|
//
|
|
// is functioning correctly if
|
|
//
|
|
// normf( v - z )
|
|
//
|
|
// is negligible, where
|
|
//
|
|
// v = C * t
|
|
//
|
|
// z = ( beta * C_orig + alpha * conja(A) * transb(B) ) * t (side = left)
|
|
// = beta * C_orig * t + alpha * conja(A) * transb(B) * t
|
|
// = beta * C_orig * t + alpha * conja(A) * w
|
|
// = beta * C_orig * t + z
|
|
//
|
|
// z = ( beta * C_orig + alpha * transb(B) * conja(A) ) * t (side = right)
|
|
// = beta * C_orig * t + alpha * transb(B) * conja(A) * t
|
|
// = beta * C_orig * t + alpha * transb(B) * w
|
|
// = beta * C_orig * t + z
|
|
|
|
bli_obj_scalar_init_detached( dt_real, &norm );
|
|
|
|
if ( bli_is_left( side ) )
|
|
{
|
|
bli_obj_create( dt, n, 1, 0, 0, &t );
|
|
bli_obj_create( dt, m, 1, 0, 0, &v );
|
|
bli_obj_create( dt, m, 1, 0, 0, &w );
|
|
bli_obj_create( dt, m, 1, 0, 0, &z );
|
|
}
|
|
else // else if ( bli_is_left( side ) )
|
|
{
|
|
bli_obj_create( dt, n, 1, 0, 0, &t );
|
|
bli_obj_create( dt, m, 1, 0, 0, &v );
|
|
bli_obj_create( dt, n, 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 );
|
|
|
|
if ( bli_is_left( side ) )
|
|
{
|
|
bli_gemv( &BLIS_ONE, b, &t, &BLIS_ZERO, &w );
|
|
bli_symv( alpha, a, &w, &BLIS_ZERO, &z );
|
|
}
|
|
else
|
|
{
|
|
bli_symv( &BLIS_ONE, a, &t, &BLIS_ZERO, &w );
|
|
bli_gemv( alpha, b, &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 );
|
|
}
|
|
|