mirror of
https://github.com/amd/blis.git
synced 2026-05-11 17:50:00 +00:00
Details:
- Updated herk_front() and her2k_front() to explicitly set the imaginary
components of the diagonal entries of C to zero after the computation
is complete. This is needed in case downstream applications read the
full diagonal entries (i.e., including imaginary part), which could, in
the absence of this modification, accumulate numerical error from
subsequent rank-k/rank-2k updates.
- Updated BLAS compatibility wrappers for herk and her2k to return early
if:
n == 0 || ( ( alpha == 0 || k == 0 ) && beta == 1 )
This also results in the imaginary components of diagonal entries NOT
being set to zero (see above), which is consistent with BLAS.
- Updated mkherm to use setid instead of an inlined loop over the
diagonal.
201 lines
4.8 KiB
C
201 lines
4.8 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 <unistd.h>
|
|
#include "blis.h"
|
|
|
|
// uploa transa m k alpha a lda beta c ldc
|
|
//void dsyrk_( char*, char*, int*, int*, double*, double*, int*, double*, double*, int* );
|
|
|
|
//#define PRINT
|
|
|
|
int main( int argc, char** argv )
|
|
{
|
|
obj_t a, c;
|
|
obj_t c_save;
|
|
obj_t alpha, beta;
|
|
dim_t m, k;
|
|
dim_t p;
|
|
dim_t p_begin, p_end, p_inc;
|
|
int m_input, k_input;
|
|
num_t dt_a, dt_c;
|
|
num_t dt_alpha, dt_beta;
|
|
int r, n_repeats;
|
|
uplo_t uplo;
|
|
|
|
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;
|
|
k_input = -1;
|
|
//k_input = 200;
|
|
#else
|
|
p_begin = 16;
|
|
p_end = 16;
|
|
p_inc = 1;
|
|
|
|
m_input = 3;
|
|
k_input = 1;
|
|
#endif
|
|
|
|
#if 0
|
|
dt_a = dt_c = dt_alpha = dt_beta = BLIS_DOUBLE;
|
|
#else
|
|
dt_a = dt_c = dt_alpha = dt_beta = BLIS_DCOMPLEX;
|
|
#endif
|
|
|
|
uplo = BLIS_LOWER;
|
|
//uplo = BLIS_UPPER;
|
|
|
|
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 ( 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_c, m, m, 0, 0, &c );
|
|
bli_obj_create( dt_c, m, m, 0, 0, &c_save );
|
|
|
|
bli_randm( &a );
|
|
bli_randm( &c );
|
|
|
|
bli_obj_set_struc( BLIS_HERMITIAN, c );
|
|
bli_obj_set_uplo( uplo, c );
|
|
|
|
|
|
bli_setsc( (2.0/1.0), 0.0, &alpha );
|
|
bli_setsc( -(1.0/1.0), 0.0, &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( "c", &c, "%4.1f", "" );
|
|
#endif
|
|
|
|
#ifdef BLIS
|
|
|
|
//bli_error_checking_level_set( BLIS_NO_ERROR_CHECKING );
|
|
|
|
bli_herk( &alpha,
|
|
&a,
|
|
&beta,
|
|
&c );
|
|
|
|
#else
|
|
|
|
f77_char uploa = 'L';
|
|
f77_char transa = 'N';
|
|
f77_int mm = bli_obj_length( c );
|
|
f77_int kk = bli_obj_width_after_trans( a );
|
|
f77_int lda = bli_obj_col_stride( a );
|
|
f77_int ldc = bli_obj_col_stride( c );
|
|
double* alphap = bli_obj_buffer( alpha );
|
|
double* ap = bli_obj_buffer( a );
|
|
double* betap = bli_obj_buffer( beta );
|
|
double* cp = bli_obj_buffer( c );
|
|
|
|
dsyrk_( &uploa,
|
|
&transa,
|
|
&mm,
|
|
&kk,
|
|
alphap,
|
|
ap, &lda,
|
|
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 = ( 1.0 * m * k * m ) / ( dtime_save * 1.0e9 );
|
|
|
|
#ifdef BLIS
|
|
printf( "data_herk_blis" );
|
|
#else
|
|
printf( "data_herk_%s", BLAS );
|
|
#endif
|
|
printf( "( %2lu, 1:4 ) = [ %4lu %4lu %10.3e %6.3f ];\n",
|
|
( unsigned long )(p - p_begin + 1)/p_inc + 1,
|
|
( unsigned long )m,
|
|
( unsigned long )k, dtime_save, gflops );
|
|
|
|
|
|
bli_obj_free( &alpha );
|
|
bli_obj_free( &beta );
|
|
|
|
bli_obj_free( &a );
|
|
bli_obj_free( &c );
|
|
bli_obj_free( &c_save );
|
|
}
|
|
|
|
bli_finalize();
|
|
|
|
return 0;
|
|
}
|
|
|