amd/blis
1
0
Fork 0
mirror of https://github.com/amd/blis.git synced 2026-05-24 18:34:40 +00:00
Code Issues Packages Projects Releases Wiki Activity
Files
efdb5a06dfa6cdf66835e1107fa1ad72fe1a73bd
blis/bench/bench_dotv.c
Rayan, Rohan 1bb1160061 Fixing bench overflow in GFLOPS computation 
Fixing a bug in some bench applications where GFLOPS computation ran into integer overflows because explicit type casting to double was not done in the computation

removing all multiplies by 1.0 during GFLOP computation

AMD-Internal: CPUPL-7016

---------
Co-authored-by: Rayan <rohrayan@amd.com>
2025-08-01 11:08:53 +05:30

356 lines
10 KiB
C
Raw Blame History

/*
BLIS
An object-based framework for developing high-performance BLAS-like
libraries.
Copyright (C) 2021 - 2025, Advanced Micro Devices, Inc. All rights reserved.
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.
*/
#ifdef WIN32
#include <io.h>
#else
#include <unistd.h>
#endif
#include "blis.h"
#include "blis_int_type.h"
// Benchmark application to process aocl logs generated by BLIS library.
#ifndef DT
#define DT BLIS_DOUBLE
#endif
#define AOCL_MATRIX_INITIALISATION
//#define BLIS_ENABLE_CBLAS
/* For BLIS since logs are collected at BLAS interfaces
* we disable cblas interfaces for this benchmark application
*/
/* #ifdef BLIS_ENABLE_CBLAS */
/* #define CBLAS */
/* #endif */
int main( int argc, char** argv )
{
obj_t x, y, res;
dim_t p_inc = 0; // to keep track of number of inputs
num_t dt;
char dt_ch, conjx_ch;
int r, n_repeats;
double dtime;
double dtime_save;
double gflops;
FILE* fin = NULL;
FILE* fout = NULL;
n_repeats = N_REPEAT; // This macro will get from Makefile.
dt = DT;
if (argc < 3)
{
printf("Usage: ./test_dotv_XX.x input.csv output.csv\n");
exit(1);
}
fin = fopen(argv[1], "r");
if (fin == NULL)
{
printf("Error opening the file %s\n", argv[1]);
exit(1);
}
fout = fopen(argv[2], "w");
if (fout == NULL)
{
printf("Error opening output file %s\n", argv[2]);
exit(1);
}
fprintf(fout, "Func Dt trans n incx incy gflops\n");
dim_t n;
inc_t incx;
inc_t incy;
conj_t conjx;
char tmp[256]; // to store function name, line no present in logs.
// {S,D,C,Z} {conjx n incx incy}
while (fscanf(fin, "%s %c %c " INT_FS INT_FS INT_FS "\n",
tmp, &dt_ch, &conjx_ch, &n, &incx, &incy) == 6)
{
#ifdef PRINT
fprintf (stdout, "Input = %s %c %c " INT_FS INT_FS INT_FS "%6.3f\n",
tmp, dt_ch, conjx_ch, n, incx, incy, gflops);
#endif
if (dt_ch == 'D' || dt_ch == 'd') dt = BLIS_DOUBLE;
else if (dt_ch == 'Z' || dt_ch == 'z') dt = BLIS_DCOMPLEX;
else if (dt_ch == 'S' || dt_ch == 's') dt = BLIS_FLOAT;
else if (dt_ch == 'C' || dt_ch == 'c') dt = BLIS_SCOMPLEX;
else
{
printf("Invalid data type %c\n", dt_ch);
continue;
}
if ( conjx_ch == 'C' || conjx_ch == 'c' ) conjx = BLIS_CONJUGATE;
else if ( conjx_ch == 'N' || conjx_ch == 'n' ) conjx = BLIS_NO_CONJUGATE;
else
{
printf("Invalid conjugate value %c\n", conjx_ch);
continue;
}
// Create objects with required sizes and strides.
//
// The ?dot routines perform a vector-vector reduction operation defined as
// dot product of two vector x and y
//
// where:
// n is lenght of vector
// x is an n-element vector, Array size at least (1+(n-1)*abs(incx)).
// y is an n-element vector, Array size at least (1+(n-1)*abs(incy)).
bli_obj_create( dt, n, 1, incx, 1, &x );
bli_obj_create( dt, n, 1, incy, 1, &y );
bli_obj_create( dt, 1, 1, 0, 0, &res );
#ifdef AOCL_MATRIX_INITIALISATION
bli_randm( &x );
bli_randm( &y );
#endif
dtime_save = DBL_MAX;
for ( r = 0; r < n_repeats; ++r )
{
dtime = bli_clock();
#ifdef PRINT
bli_printm( "x", &x, "%4.1f", "" );
bli_printm( "y", &y, "%4.1f", "" );
#endif
#ifdef BLIS
bli_dotv( &x,
&y,
&res);
#else
// Data type independent variables
f77_int nn = bli_obj_length( &x );
f77_int incx = bli_obj_vector_inc( &x );
f77_int incy = bli_obj_vector_inc( &y );
if ( bli_is_float( dt ) )
{
float* xp = bli_obj_buffer( &x );
float* yp = bli_obj_buffer( &y );
float* resp = bli_obj_buffer( &res );
#ifdef CBLAS
*resp = cblas_sdot( nn,
xp, incx,
yp, incy );
#else
*resp = sdot_( &nn,
xp, &incx,
yp, &incy );
#endif
}
else if ( bli_is_double( dt ) )
{
double* xp = bli_obj_buffer( &x );
double* yp = bli_obj_buffer( &y );
double* resp = bli_obj_buffer( &res );
#ifdef CBLAS
*resp = cblas_ddot( nn,
xp, incx,
yp, incy );
#else
*resp = ddot_( &nn,
xp, &incx,
yp, &incy );
#endif
}
else if ( bli_is_scomplex( dt ) && !bli_is_conj( conjx ) )
{
scomplex* xp = bli_obj_buffer( &x );
scomplex* yp = bli_obj_buffer( &y );
scomplex* resp = bli_obj_buffer( &res );
#ifdef CBLAS
cblas_cdotu_sub( nn,
xp, incx,
yp, incy, resp );
#else
#ifdef BLIS_DISABLE_COMPLEX_RETURN_INTEL
*resp = cdotu_( &nn,
xp, &incx,
yp, &incy );
#else
cdotu_( resp, &nn,
xp, &incx,
yp, &incy );
#endif // BLIS_DISABLE_COMPLEX_RETURN_INTEL
#endif
}
else if ( bli_is_scomplex( dt ) && bli_is_conj( conjx ) )
{
scomplex* xp = bli_obj_buffer( &x );
scomplex* yp = bli_obj_buffer( &y );
scomplex* resp = bli_obj_buffer( &res );
#ifdef CBLAS
cblas_cdotc_sub( nn,
xp, incx,
yp, incy, resp );
#else
#ifdef BLIS_DISABLE_COMPLEX_RETURN_INTEL
*resp = cdotc_( &nn,
xp, &incx,
yp, &incy );
#else
cdotc_( resp, &nn,
xp, &incx,
yp, &incy );
#endif // BLIS_DISABLE_COMPLEX_RETURN_INTEL
#endif
}
else if ( bli_is_dcomplex( dt ) && !bli_is_conj( conjx ) )
{
dcomplex* xp = bli_obj_buffer( &x );
dcomplex* yp = bli_obj_buffer( &y );
dcomplex* resp = bli_obj_buffer( &res );
#ifdef CBLAS
cblas_zdotu_sub( nn,
xp, incx,
yp, incy, resp );
#else
#ifdef BLIS_DISABLE_COMPLEX_RETURN_INTEL
*resp = zdotu_( &nn,
xp, &incx,
yp, &incy );
#else
zdotu_( resp, &nn,
xp, &incx,
yp, &incy );
#endif // BLIS_DISABLE_COMPLEX_RETURN_INTEL
#endif
}
else if ( bli_is_dcomplex( dt ) && bli_is_conj( conjx ) )
{
dcomplex* xp = bli_obj_buffer( &x );
dcomplex* yp = bli_obj_buffer( &y );
dcomplex* resp = bli_obj_buffer( &res );
#ifdef CBLAS
cblas_zdotc_sub( nn,
xp, incx,
yp, incy, resp );
#else
#ifdef BLIS_DISABLE_COMPLEX_RETURN_INTEL
*resp = zdotc_( &nn,
xp, &incx,
yp, &incy );
#else
zdotc_( resp, &nn,
xp, &incx,
yp, &incy );
#endif // BLIS_DISABLE_COMPLEX_RETURN_INTEL
#endif
}
#endif // BLIS Interface
#ifdef PRINT
bli_printm( "res", &res, "%4.1f", "" );
exit(1);
#endif
dtime_save = bli_clock_min_diff( dtime_save, dtime );
}
gflops = ( 2.0 * (double)n ) / ( dtime_save * 1.0e9 );
if ( bli_is_complex( dt ) ) gflops *= 4.0;
printf( "data_dotv_%s", BLAS );
p_inc++;
printf("( %2lu, 1:4 ) = [ %4lu %7.2f ];\n",
(unsigned long)(p_inc),
(unsigned long)n,
gflops);
fprintf (fout, "%s %c %c" INT_FS INT_FS INT_FS " %6.3f\n",
tmp, dt_ch, conjx_ch, n, incx, incy, gflops);
fflush(fout);
bli_obj_free( &x );
bli_obj_free( &y );
bli_obj_free( &res );
}
//bli_finalize();
fclose(fin);
fclose(fout);
return 0;
}
Reference in New Issue View Git Blame Copy Permalink