amd/blis
1
0
Fork 0
mirror of https://github.com/amd/blis.git synced 2026-04-19 23:28:52 +00:00
Code Issues Packages Projects Releases Wiki Activity

Added AOCL progress support for BLIS

Browse Source 
-- AOCL libraries are used for lengthy computations which can go
     on for hours or days, once the operation is started, the user
     doesn’t get any update on current state of the computation.
     This (AOCL progress) feature enables user to receive a periodic
     update from the libraries.
  -- User registers a callback with the library if it is interested
     in receiving the periodic update.
  -- The library invokes this callback periodically with information
     about current state of the operation.
  -- The update frequency is statically set in the code, it can be
     modified as needed if the library is built from source.
  -- These feature is supported for GEMM and TRSM operations.

  -- Added example for GEMM and TRSM.
  -- Cleaned up and reformatted test_gemm.c and test_trsm.c to
     remove warnings and making indentation consistent across the
     file.

AMD-Internal: [CPUPL-2082]
Change-Id: I2aacdd8fb76f52e19e3850ee0295df49a8b7a90e
This commit is contained in:
Dipal M Zambare
2022-03-22 11:48:25 +05:30
parent 52e4fd0f11
commit e712ffe139
14 changed files with 1019 additions and 718 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
aocl_dtl/aocldtl.h
View File

@@ -5,7 +5,7 @@
* It provides defination for all macros to be
* used by user to add debug/trace information.
*
* Copyright (C) 2020-2021, Advanced Micro Devices, Inc. All rights reserved.
* Copyright (C) 2020-2022, Advanced Micro Devices, Inc. All rights reserved.
*
*==================================================================*/
@@ -15,6 +15,7 @@
#include "aocldtlcf.h"
#include "aocltpdef.h"
#include "aoclflist.h"
#include "aoclos.h"
#define TRACE_TYPE_FENTRY (1)
#define TRACE_TYPE_FEXIT (2)

13
aocl_dtl/aoclos.c
View File

@@ -3,7 +3,7 @@
*
* Description : Abstraction for os services used by DTL.
*
* Copyright (C) 2020, Advanced Micro Devices, Inc
* Copyright (C) 2022, Advanced Micro Devices, Inc. All rights reserved.
*
*==================================================================*/
#include "aocltpdef.h"
@@ -85,8 +85,15 @@ uint64 AOCL_getTimestamp(void)
#else /* Non linux support */
AOCL_TID AOCL_gettid(void)
{
/* stub for other os's */
return 0;
#ifdef BLIS_ENABLE_OPENMP
return omp_get_thread_num();
#else
#ifdef BLIS_ENABLE_PTHREADS
return pthread_self();
#else
return 0;
#endif
#endif
}
pid_t AOCL_getpid(void)

4
aocl_dtl/aoclos.h
View File

@@ -3,7 +3,7 @@
*
* Description : Abstraction for os services used by DTL.
*
* Copyright (C) 2020, Advanced Micro Devices, Inc
* Copyright (C) 2022, Advanced Micro Devices, Inc. All rights reserved.
*
*==================================================================*/
@@ -19,7 +19,7 @@
#define AOCL_malloc malloc
#define AOCL_free free
uint32 AOCL_gettid(void);
AOCL_TID AOCL_gettid(void);
pid_t AOCL_getpid(void);
uint64 AOCL_getTimestamp(void);

18
frame/3/gemm/bli_gemm_ker_var2.c
View File

@@ -5,7 +5,7 @@
libraries.
Copyright (C) 2014, The University of Texas at Austin
Copyright (C) 2018 - 2019, Advanced Micro Devices, Inc.
Copyright (C) 2018 - 2022, 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
@@ -407,6 +407,22 @@ void PASTEMAC(ch,varname) \
} \
} \
\
/* Send progress update if the user has enabled it */ \
if(AOCL_progress_ptr) { \
/* Running total for current thread */ \
tls_aoclprogress_counter += m * n * k; \
/* Send the update only if enough number of elements are processes */ \
if ((tls_aoclprogress_counter - tls_aoclprogress_last_update) >= AOCL_PROGRESS_FREQUENCY) \
{ \
tls_aoclprogress_last_update = tls_aoclprogress_counter; \
AOCL_PROGRESS_DT(*MKSTR(ch), \
"gemm", \
tls_aoclprogress_counter, \
AOCL_gettid(), \
bli_rntm_num_threads(rntm)); \
}\
} \
\
/*
PASTEMAC(ch,fprintm)( stdout, "gemm_ker_var2: b1", k, NR, b1, NR, 1, "%4.1f", "" ); \
PASTEMAC(ch,fprintm)( stdout, "gemm_ker_var2: a1", MR, k, a1, 1, MR, "%4.1f", "" ); \

55
frame/3/trsm/bli_trsm_xx_ker_var2.c
View File

@@ -5,7 +5,7 @@
libraries.
Copyright (C) 2014, The University of Texas at Austin
Copyright (C) 2018 - 2020, Advanced Micro Devices, Inc. All rights reserved.
Copyright (C) 2018 - 2022, 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
@@ -87,6 +87,59 @@ void bli_trsm_xx_ker_var2
cntl,
thread
);
// Send progress update if enabled
if (AOCL_progress_ptr)
{
// Get the size of block processed in
// this iteration, add it to the accumulated
// total and send the update.
dim_t m = bli_obj_length(c);
dim_t n = bli_obj_width(c);
dim_t k = bli_obj_width(a);
num_t dt = bli_obj_dt(c);
char dt_c;
// Running total for current thread.
tls_aoclprogress_counter += m * n * k;
// Send the update only if number of elements processes so far
// has exceeded the freqency of reporting.
if ((tls_aoclprogress_counter - tls_aoclprogress_last_update) >=
AOCL_PROGRESS_FREQUENCY)
{
// reset the last update counter for next iteration.
tls_aoclprogress_last_update = tls_aoclprogress_counter;
switch (dt)
{
case BLIS_FLOAT:
dt_c = 's';
break;
case BLIS_DOUBLE:
dt_c = 'd';
break;
case BLIS_SCOMPLEX:
dt_c = 'c';
break;
case BLIS_DCOMPLEX:
dt_c = 'z';
break;
default:
dt_c = ' ';
}
AOCL_PROGRESS_DT(dt_c,
"trsm",
tls_aoclprogress_counter,
AOCL_gettid(),
bli_rntm_num_threads(rntm));
}
}
AOCL_DTL_TRACE_EXIT(AOCL_DTL_LEVEL_TRACE_6);
}

8
frame/include/bli_config_macro_defs.h
View File

@@ -5,7 +5,7 @@
libraries.
Copyright (C) 2014, The University of Texas at Austin
Copyright (C) 2019, Advanced Micro Devices, Inc.
Copyright (C) 2019-2022, 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
@@ -261,5 +261,11 @@
#endif
#ifdef BLIS_OS_WINDOWS
#define BLIS_TLS_TYPE __declspec(thread)
#else
#define BLIS_TLS_TYPE __thread
#endif
#endif

13
frame/thread/bli_l3_decor_openmp.c
View File

@@ -5,7 +5,7 @@
libraries.
Copyright (C) 2014, The University of Texas at Austin
Copyright (C) 2018, Advanced Micro Devices, Inc.
Copyright (C) 2018-2022, 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
@@ -140,6 +140,17 @@ void bli_l3_thread_decorator
bli_l3_thrinfo_create_root( tid, gl_comm, rntm_p, cntl_use, &thread );
#if 1
// Reset the progress state to 0 as we are starting new operations.
// This counter track running progress in current thread.
tls_aoclprogress_counter = 0;
// We send the update only after certain threshold is reached,
// The thresold is defined as AOCL_PROGRESS_FREQUENCY.
// This variable stores the counter value when last update was sent.
// It is compared with current counter value to see if it is time to
// send the next update.
tls_aoclprogress_last_update = 0;
func
(
alpha,

15
frame/thread/bli_l3_decor_single.c
View File

@@ -5,7 +5,7 @@
libraries.
Copyright (C) 2014, The University of Texas at Austin
Copyright (C) 2018, Advanced Micro Devices, Inc.
Copyright (C) 2018-2022, 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
@@ -115,7 +115,18 @@ void bli_l3_thread_decorator
// Create the root node of the thread's thrinfo_t structure.
bli_l3_thrinfo_create_root( tid, gl_comm, rntm_p, cntl_use, &thread );
// Reset the progress state to 0 as we are starting new operations.
// This counter track running progress in current thread.
tls_aoclprogress_counter = 0;
// We send the update only after certain threshold is reached,
// The thresold is defined as AOCL_PROGRESS_FREQUENCY.
// This variable stores the counter value when last update was sent.
// It is compared with current counter value to see if it is time to
// send the next update.
tls_aoclprogress_last_update = 0;
func
(
alpha,

3
frame/util/CMakeLists.txt
View File

@@ -1,4 +1,4 @@
##Copyright (C) 2020, Advanced Micro Devices, Inc. All rights reserved.##
##Copyright (C) 2022, Advanced Micro Devices, Inc. All rights reserved.##
target_sources("${PROJECT_NAME}"
PRIVATE
@@ -13,4 +13,5 @@ target_sources("${PROJECT_NAME}"
${CMAKE_CURRENT_SOURCE_DIR}/bli_util_unb_var1.c
${CMAKE_CURRENT_SOURCE_DIR}/bli_util_update.c
${CMAKE_CURRENT_SOURCE_DIR}/bli_util_api_wrap.c
${CMAKE_CURRENT_SOURCE_DIR}/bli_util_progress.c
)

5
frame/util/bli_util.h
View File

@@ -5,7 +5,7 @@
libraries.
Copyright (C) 2014, The University of Texas at Austin
Copyright (C) 2020 - 2021, Advanced Micro Devices, Inc. All rights reserved.
Copyright (C) 2020 - 2022, 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
@@ -63,3 +63,6 @@
// Header file define different formats of BLAS APIs- uppercase with
// and without underscore, lowercase without underscore.
#include "bli_util_api_wrap.h"
// Public interface for the progress feature
#include "bli_util_progress.h"

56
frame/util/bli_util_progress.c Normal file
View File

@@ -0,0 +1,56 @@
/*
BLIS
An object-based framework for developing high-performance BLAS-like
libraries.
Copyright (C) 2022, 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.
*/
#include "blis.h"
// The progress feature periodically updates the user with current state
// of the operation, We maintain the progress for each thread separately
// following variables are used to store the elements processed in each
// thread using thread local storage.
BLIS_TLS_TYPE dim_t tls_aoclprogress_counter;
// Store the counter when last update was sent, this is used to implement
// update freqency.
BLIS_TLS_TYPE dim_t tls_aoclprogress_last_update;
// AOCL_progress_ptr contains the pointer to the callback function
// By default it is set to NULL, which effectivly disabled the
// progress feature.
AOCL_progress_callback AOCL_progress_ptr = NULL;
void AOCL_BLIS_set_progress(AOCL_progress_callback func)
{
AOCL_progress_ptr = func;
}

74
frame/util/bli_util_progress.h Normal file
View File

@@ -0,0 +1,74 @@
/*
BLIS
An object-based framework for developing high-performance BLAS-like
libraries.
Copyright (C) 2022, 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.
*/
#ifndef BLI_UTIL_PROGRESS_H
#define BLI_UTIL_PROGRESS_H
// Public interface for the end user.
typedef dim_t (*AOCL_progress_callback)(char *api,
dim_t lapi,
dim_t progress,
dim_t current_thread,
dim_t total_threads);
BLIS_EXPORT_BLIS void AOCL_BLIS_set_progress(AOCL_progress_callback func);
// Private interfaces for internal use
extern AOCL_progress_callback AOCL_progress_ptr;
extern BLIS_TLS_TYPE dim_t tls_aoclprogress_counter;
extern BLIS_TLS_TYPE dim_t tls_aoclprogress_last_update;
// Define the frequency of reporting (number of elements).
// Progress update will be sent only after these many
// elements are processed in the current thread.
#define AOCL_PROGRESS_FREQUENCY 1e+9
#define MAX_API_NAME_LEN 20
// Macro to send update using datatype character and the api name
#define AOCL_PROGRESS_DT(dt, api, progress, tid, nt) \
char buf[MAX_API_NAME_LEN]; \
snprintf(buf, MAX_API_NAME_LEN, "%c%s", dt, api); \
(*AOCL_progress_ptr) (buf, strlen(buf), progress, tid, nt); \
// Macro to send update using api name alone.
#define AOCL_PROGRESS_NAME(api, progress, tid, nt) \
char buf[MAX_API_NAME_LEN]; \
snprintf(buf, MAX_API_NAME_LEN, "%s", dt, api); \
(*AOCL_progress_ptr) (buf, strlen(buf), progress, tid, nt); \
#endif // BLI_UTIL_PROGRESS_H

781
test/test_gemm.c
View File

@@ -10,14 +10,14 @@
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.
- 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
@@ -47,426 +47,471 @@
// uncomment to enable cblas interface
//#define CBLAS
int main( int argc, char** argv )
// Uncomment to enable progress printing.
//#define PROGRESS_ENABLED
#ifdef PROGRESS_ENABLED
dim_t AOCL_progress(char *api,
dim_t lapi,
dim_t progress,
dim_t current_thread,
dim_t total_threads)
{
obj_t a, b, c;
obj_t c_save;
obj_t alpha, beta;
dim_t m, n, k;
inc_t lda, ldb, ldc;
num_t dt, dt_a;
inc_t r, n_repeats;
trans_t transa;
trans_t transb;
f77_char f77_transa;
f77_char f77_transb;
printf("\n%s, len = %ld, nt = %ld, tid = %ld, Processed %ld Elements",
api, lapi, total_threads, current_thread, progress);
double dtime;
double dtime_save;
double gflops;
return 0;
}
#endif
//bli_init();
//bli_error_checking_level_set( BLIS_NO_ERROR_CHECKING );
int main(int argc, char **argv)
{
obj_t a, b, c;
obj_t c_save;
obj_t alpha, beta;
dim_t m, n, k;
inc_t lda, ldb, ldc;
num_t dt, dt_a;
inc_t r, n_repeats;
trans_t transa;
trans_t transb;
f77_char f77_transa;
f77_char f77_transb;
n_repeats = 300;
double dtime;
double dtime_save;
double gflops;
//dt = BLIS_FLOAT;
dt = BLIS_DOUBLE;
//dt = BLIS_SCOMPLEX;
//dt = BLIS_DCOMPLEX;
#ifdef PROGRESS_ENABLED
AOCL_BLIS_set_progress(AOCL_progress);
#endif
if( bli_is_real( dt ) || bli_is_scomplex( dt ) )
// bli_init();
// bli_error_checking_level_set( BLIS_NO_ERROR_CHECKING );
n_repeats = 300;
// dt = BLIS_FLOAT;
dt = BLIS_DOUBLE;
// dt = BLIS_SCOMPLEX;
// dt = BLIS_DCOMPLEX;
if (bli_is_real(dt) || bli_is_scomplex(dt))
dt_a = dt;
else
{
dt_a = dt;
// Enable the following to call
// dzgemm
//dt_a = BLIS_DOUBLE;
// dzgemm
// dt_a = BLIS_DOUBLE;
}
const char stor_scheme = 'C';
transa = BLIS_NO_TRANSPOSE;
transb = BLIS_NO_TRANSPOSE;
bli_param_map_blis_to_netlib_trans( transa, &f77_transa );
bli_param_map_blis_to_netlib_trans( transb, &f77_transb );
transa = BLIS_NO_TRANSPOSE;
transb = BLIS_NO_TRANSPOSE;
bli_param_map_blis_to_netlib_trans(transa, &f77_transa);
bli_param_map_blis_to_netlib_trans(transb, &f77_transb);
printf("BLIS Library version is : %s\n", bli_info_get_version_str());
#ifdef FILE_IN_OUT
FILE* fin = NULL;
FILE* fout = NULL;
if (argc < 3){
printf("Usage: ./test_gemm_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, "m\t k\t n\t cs_a\t cs_b\t cs_c\t gflops\n");
printf("~~~~~~~~~~_BLAS\t m\t k\t n\t cs_a\t cs_b\t cs_c \t gflops\n");
FILE *fin = NULL;
FILE *fout = NULL;
if (argc < 3)
{
printf("Usage: ./test_gemm_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, "m\t k\t n\t cs_a\t cs_b\t cs_c\t gflops\n");
printf("~~~~~~~~~~_BLAS\t m\t k\t n\t cs_a\t cs_b\t cs_c \t gflops\n");
while (fscanf(fin, "%lld %lld %lld %lld %lld %lld\n", &m, &k, &n, &lda, &ldb, &ldc) == 6)
{
// dimensions should not be greater than leading dimensions
// These are valid only when Op(A) = n and op(B) = n
if( (stor_scheme == 'C') || (stor_scheme == 'c') ) {
if ((m > lda) || (k > ldb) || (m > ldc)) continue;
}else if( (stor_scheme == 'R') || (stor_scheme == 'r') ) {
// leading dimension should be greater than number of cols
if ((k > lda) || (n > ldb) || (n > ldc)) continue;
}else {
printf("Invalid Storage type\n");
continue;
}
while (fscanf(fin, "%ld %ld %ld %ld %ld %ld\n", &m, &k, &n, &lda, &ldb, &ldc) == 6)
{
// dimensions should not be greater than leading dimensions
// These are valid only when Op(A) = n and op(B) = n
if ((stor_scheme == 'C') || (stor_scheme == 'c'))
{
if ((m > lda) || (k > ldb) || (m > ldc))
continue;
}
else if ((stor_scheme == 'R') || (stor_scheme == 'r'))
{
// leading dimension should be greater than number of cols
if ((k > lda) || (n > ldb) || (n > ldc))
continue;
}
else
{
printf("Invalid Storage type\n");
continue;
}
#else
dim_t p, p_begin, p_end, p_inc;
dim_t m_input, n_input, k_input;
p_begin = 200;
p_end = 2000;
p_inc = 200;
dim_t p, p_begin, p_end, p_inc;
dim_t m_input, n_input, k_input;
p_begin = 200;
p_end = 2000;
p_inc = 200;
m_input = n_input = k_input = -1;
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;
if( (stor_scheme == 'C') || (stor_scheme == 'c') ) {
lda = m; ldb = k, ldc = m;
}else if( (stor_scheme == 'R') || (stor_scheme == 'r') ) {
lda = k; ldb = n, ldc = n;
}
m_input = n_input = k_input = -1;
for (p = p_begin; p <= p_end; p += p_inc)
{
if (m_input < 0)
m = p * (dim_t)labs(m_input);
else
m = (dim_t)m_input;
if (n_input < 0)
n = p * (dim_t)labs(n_input);
else
n = (dim_t)n_input;
if (k_input < 0)
k = p * (dim_t)labs(k_input);
else
k = (dim_t)k_input;
if ((stor_scheme == 'C') || (stor_scheme == 'c'))
{
lda = m;
ldb = k, ldc = m;
}
else if ((stor_scheme == 'R') || (stor_scheme == 'r'))
{
lda = k;
ldb = n, ldc = n;
}
#endif
bli_obj_create( dt, 1, 1, 0, 0, &alpha);
bli_obj_create( dt, 1, 1, 0, 0, &beta );
bli_obj_create(dt, 1, 1, 0, 0, &alpha);
bli_obj_create(dt, 1, 1, 0, 0, &beta);
siz_t elem_size = bli_dt_size( dt );
siz_t elem_size = bli_dt_size(dt);
lda = bli_align_dim_to_size( lda, elem_size, BLIS_HEAP_STRIDE_ALIGN_SIZE );
ldb = bli_align_dim_to_size( ldb, elem_size, BLIS_HEAP_STRIDE_ALIGN_SIZE );
ldc = bli_align_dim_to_size( ldc, elem_size, BLIS_HEAP_STRIDE_ALIGN_SIZE );
lda = bli_align_dim_to_size(lda, elem_size, BLIS_HEAP_STRIDE_ALIGN_SIZE);
ldb = bli_align_dim_to_size(ldb, elem_size, BLIS_HEAP_STRIDE_ALIGN_SIZE);
ldc = bli_align_dim_to_size(ldc, elem_size, BLIS_HEAP_STRIDE_ALIGN_SIZE);
// Will verify the leading dimension is powers of 2 and add 64bytes.
inc_t n_bytes = lda*sizeof(dt_a);
// Will verify the leading dimension is powers of 2 and add 64bytes.
inc_t n_bytes = lda * sizeof(dt_a);
if((n_bytes!=0) && !(n_bytes&(n_bytes-1)))// check whether n_bytes is power of 2.
lda += BLIS_SIMD_ALIGN_SIZE/sizeof(dt_a);
if ((n_bytes != 0) && !(n_bytes & (n_bytes - 1))) // check whether n_bytes is power of 2.
lda += BLIS_SIMD_ALIGN_SIZE / sizeof(dt_a);
n_bytes = ldb*sizeof(dt);
if((n_bytes!=0) && !(n_bytes&(n_bytes-1)))// check whether n_bytes is power of 2.
ldb += BLIS_SIMD_ALIGN_SIZE/sizeof(dt);
n_bytes = ldb * sizeof(dt);
if ((n_bytes != 0) && !(n_bytes & (n_bytes - 1))) // check whether n_bytes is power of 2.
ldb += BLIS_SIMD_ALIGN_SIZE / sizeof(dt);
n_bytes = ldc*sizeof(dt);
if((n_bytes!=0) && !(n_bytes&(n_bytes-1)))// check whether n_bytes is power of 2.
ldc += BLIS_SIMD_ALIGN_SIZE/sizeof(dt);
n_bytes = ldc * sizeof(dt);
if ((n_bytes != 0) && !(n_bytes & (n_bytes - 1))) // check whether n_bytes is power of 2.
ldc += BLIS_SIMD_ALIGN_SIZE / sizeof(dt);
if( (stor_scheme == 'C') || (stor_scheme == 'c') )
{
// Col-major Order
bli_obj_create( dt_a, m, k, 1, lda, &a );
bli_obj_create( dt, k, n, 1, ldb, &b );
bli_obj_create( dt, m, n, 1, ldc, &c );
bli_obj_create( dt, m, n, 1, ldc, &c_save );
}
else if( (stor_scheme == 'R') || (stor_scheme == 'r') )
{
// Row-major Order
bli_obj_create( dt_a, m, k, lda, 1, &a );
bli_obj_create( dt, k, n, ldb, 1, &b );
bli_obj_create( dt, m, n, ldc, 1, &c );
bli_obj_create( dt, m, n, ldc, 1, &c_save );
}
else
{
printf("Invalid Storage type\n");
continue;
}
#ifdef MATRIX_INITIALISATION
bli_randm( &a );
bli_randm( &b );
bli_randm( &c );
#endif
bli_obj_set_conjtrans( transa, &a);
bli_obj_set_conjtrans( transb, &b);
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 = DBL_MAX;
for ( r = 0; r < n_repeats; ++r )
{
bli_copym( &c_save, &c );
dtime = bli_clock();
#ifdef BLIS
bli_gemm( &alpha,
&a,
&b,
&beta,
&c );
#else
f77_int lda, ldb, ldc;
f77_int mm = bli_obj_length( &c );
f77_int kk = bli_obj_width_after_trans( &a );
f77_int nn = bli_obj_width( &c );
#ifdef CBLAS
enum CBLAS_ORDER cblas_order;
enum CBLAS_TRANSPOSE cblas_transa;
enum CBLAS_TRANSPOSE cblas_transb;
if ( bli_obj_row_stride( &c ) == 1 ){
cblas_order = CblasColMajor;
}else{
cblas_order = CblasRowMajor;
}
if( bli_is_trans( transa ) )
cblas_transa = CblasTrans;
else if( bli_is_conjtrans( transa ) )
cblas_transa = CblasConjTrans;
else
cblas_transa = CblasNoTrans;
if( bli_is_trans( transb ) )
cblas_transb = CblasTrans;
else if( bli_is_conjtrans( transb ) )
cblas_transb = CblasConjTrans;
else
cblas_transb = CblasNoTrans;
#else
f77_char f77_transa;
f77_char f77_transb;
bli_param_map_blis_to_netlib_trans( transa, &f77_transa );
bli_param_map_blis_to_netlib_trans( transb, &f77_transb );
#endif
if( (stor_scheme == 'C') || (stor_scheme == 'c') ){
lda = bli_obj_col_stride( &a );
ldb = bli_obj_col_stride( &b );
ldc = bli_obj_col_stride( &c );
} else {
lda = bli_obj_row_stride( &a );
ldb = bli_obj_row_stride( &b );
ldc = bli_obj_row_stride( &c );
if ((stor_scheme == 'C') || (stor_scheme == 'c'))
{
// Col-major Order
bli_obj_create(dt_a, m, k, 1, lda, &a);
bli_obj_create(dt, k, n, 1, ldb, &b);
bli_obj_create(dt, m, n, 1, ldc, &c);
bli_obj_create(dt, m, n, 1, ldc, &c_save);
}
else if ((stor_scheme == 'R') || (stor_scheme == 'r'))
{
// Row-major Order
bli_obj_create(dt_a, m, k, lda, 1, &a);
bli_obj_create(dt, k, n, ldb, 1, &b);
bli_obj_create(dt, m, n, ldc, 1, &c);
bli_obj_create(dt, m, n, ldc, 1, &c_save);
}
else
{
printf("Invalid Storage type\n");
continue;
}
if ( bli_is_float( dt ) )
{
float* alphap = bli_obj_buffer( &alpha );
float* ap = bli_obj_buffer( &a );
float* bp = bli_obj_buffer( &b );
float* betap = bli_obj_buffer( &beta );
float* cp = bli_obj_buffer( &c );
#ifdef CBLAS
cblas_sgemm( cblas_order,
cblas_transa,
cblas_transb,
mm,
nn,
kk,
*alphap,
ap, lda,
bp, ldb,
*betap,
cp, ldc
);
#else
sgemm_( &f77_transa,
&f77_transb,
&mm,
&nn,
&kk,
alphap,
ap, (f77_int*)&lda,
bp, (f77_int*)&ldb,
betap,
cp, (f77_int*)&ldc );
#ifdef MATRIX_INITIALISATION
bli_randm(&a);
bli_randm(&b);
bli_randm(&c);
#endif
}else if ( bli_is_double( dt ) )
{
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 );
#ifdef CBLAS
cblas_dgemm( cblas_order,
cblas_transa,
cblas_transb,
mm,
nn,
kk,
*alphap,
ap, lda,
bp, ldb,
*betap,
cp, ldc
);
bli_obj_set_conjtrans(transa, &a);
bli_obj_set_conjtrans(transb, &b);
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 = DBL_MAX;
for (r = 0; r < n_repeats; ++r)
{
bli_copym(&c_save, &c);
dtime = bli_clock();
#ifdef BLIS
bli_gemm(&alpha,
&a,
&b,
&beta,
&c);
#else
dgemm_( &f77_transa,
&f77_transb,
&mm,
&nn,
&kk,
alphap,
ap, (f77_int*)&lda,
bp, (f77_int*)&ldb,
betap,
cp, (f77_int*)&ldc );
#endif
}else if ( bli_is_scomplex( dt ) )
{
scomplex* alphap = bli_obj_buffer( &alpha );
scomplex* ap = bli_obj_buffer( &a );
scomplex* bp = bli_obj_buffer( &b );
scomplex* betap = bli_obj_buffer( &beta );
scomplex* cp = bli_obj_buffer( &c );
f77_int lda, ldb, ldc;
f77_int mm = bli_obj_length(&c);
f77_int kk = bli_obj_width_after_trans(&a);
f77_int nn = bli_obj_width(&c);
#ifdef CBLAS
cblas_cgemm( cblas_order,
cblas_transa,
cblas_transb,
mm,
nn,
kk,
alphap,
ap, lda,
bp, ldb,
betap,
cp, ldc
);
enum CBLAS_ORDER cblas_order;
enum CBLAS_TRANSPOSE cblas_transa;
enum CBLAS_TRANSPOSE cblas_transb;
if (bli_obj_row_stride(&c) == 1)
{
cblas_order = CblasColMajor;
}
else
{
cblas_order = CblasRowMajor;
}
if (bli_is_trans(transa))
cblas_transa = CblasTrans;
else if (bli_is_conjtrans(transa))
cblas_transa = CblasConjTrans;
else
cblas_transa = CblasNoTrans;
if (bli_is_trans(transb))
cblas_transb = CblasTrans;
else if (bli_is_conjtrans(transb))
cblas_transb = CblasConjTrans;
else
cblas_transb = CblasNoTrans;
#else
cgemm_( &f77_transa,
&f77_transb,
&mm,
&nn,
&kk,
alphap,
ap, (f77_int*)&lda,
bp, (f77_int*)&ldb,
betap,
cp, (f77_int*)&ldc );
f77_char f77_transa;
f77_char f77_transb;
bli_param_map_blis_to_netlib_trans(transa, &f77_transa);
bli_param_map_blis_to_netlib_trans(transb, &f77_transb);
#endif
}else if ( bli_is_dcomplex( dt ) )
{
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 );
if ((stor_scheme == 'C') || (stor_scheme == 'c'))
{
lda = bli_obj_col_stride(&a);
ldb = bli_obj_col_stride(&b);
ldc = bli_obj_col_stride(&c);
}
else
{
lda = bli_obj_row_stride(&a);
ldb = bli_obj_row_stride(&b);
ldc = bli_obj_row_stride(&c);
}
if (bli_is_float(dt))
{
float *alphap = bli_obj_buffer(&alpha);
float *ap = bli_obj_buffer(&a);
float *bp = bli_obj_buffer(&b);
float *betap = bli_obj_buffer(&beta);
float *cp = bli_obj_buffer(&c);
#ifdef CBLAS
cblas_zgemm( cblas_order,
cblas_transa,
cblas_transb,
mm,
nn,
kk,
alphap,
ap, lda,
bp, ldb,
betap,
cp, ldc
);
cblas_sgemm(cblas_order,
cblas_transa,
cblas_transb,
mm,
nn,
kk,
*alphap,
ap, lda,
bp, ldb,
*betap,
cp, ldc);
#else
sgemm_(&f77_transa,
&f77_transb,
&mm,
&nn,
&kk,
alphap,
ap, (f77_int *)&lda,
bp, (f77_int *)&ldb,
betap,
cp, (f77_int *)&ldc);
#endif
}
else if (bli_is_double(dt))
{
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);
#ifdef CBLAS
cblas_dgemm(cblas_order,
cblas_transa,
cblas_transb,
mm,
nn,
kk,
*alphap,
ap, lda,
bp, ldb,
*betap,
cp, ldc);
#else
dgemm_(&f77_transa,
&f77_transb,
&mm,
&nn,
&kk,
alphap,
ap, (f77_int *)&lda,
bp, (f77_int *)&ldb,
betap,
cp, (f77_int *)&ldc);
#endif
}
else if (bli_is_scomplex(dt))
{
scomplex *alphap = bli_obj_buffer(&alpha);
scomplex *ap = bli_obj_buffer(&a);
scomplex *bp = bli_obj_buffer(&b);
scomplex *betap = bli_obj_buffer(&beta);
scomplex *cp = bli_obj_buffer(&c);
#ifdef CBLAS
cblas_cgemm(cblas_order,
cblas_transa,
cblas_transb,
mm,
nn,
kk,
alphap,
ap, lda,
bp, ldb,
betap,
cp, ldc);
#else
cgemm_(&f77_transa,
&f77_transb,
&mm,
&nn,
&kk,
alphap,
ap, (f77_int *)&lda,
bp, (f77_int *)&ldb,
betap,
cp, (f77_int *)&ldc);
#endif
}
else if (bli_is_dcomplex(dt))
{
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);
#ifdef CBLAS
cblas_zgemm(cblas_order,
cblas_transa,
cblas_transb,
mm,
nn,
kk,
alphap,
ap, lda,
bp, ldb,
betap,
cp, ldc);
#else
#if 1
if( bli_is_double( dt_a ) )
{
dzgemm_(
&f77_transa,
&f77_transb,
&mm,
&nn,
&kk,
alphap,
(double*)ap, (f77_int*)&lda,
bp, (f77_int*)&ldb,
betap,
cp, (f77_int*)&ldc
);
}
else
{
zgemm_( &f77_transa,
&f77_transb,
&mm,
&nn,
&kk,
alphap,
ap, (f77_int*)&lda,
bp, (f77_int*)&ldb,
betap,
cp, (f77_int*)&ldc );
}
if (bli_is_double(dt_a))
{
dzgemm_(
&f77_transa,
&f77_transb,
&mm,
&nn,
&kk,
alphap,
(double *)ap, (f77_int *)&lda,
bp, (f77_int *)&ldb,
betap,
cp, (f77_int *)&ldc);
}
else
{
zgemm_(&f77_transa,
&f77_transb,
&mm,
&nn,
&kk,
alphap,
ap, (f77_int *)&lda,
bp, (f77_int *)&ldb,
betap,
cp, (f77_int *)&ldc);
}
#endif
#endif
}
}
#endif
#ifdef PRINT
bli_printm( "a", &a, "%4.1f", "" );
bli_printm( "b", &b, "%4.1f", "" );
bli_printm( "c", &c, "%4.1f", "" );
bli_printm( "c after", &c, "%4.1f", "" );
exit(1);
bli_printm("a", &a, "%4.1f", "");
bli_printm("b", &b, "%4.1f", "");
bli_printm("c", &c, "%4.1f", "");
bli_printm("c after", &c, "%4.1f", "");
exit(1);
#endif
dtime_save = bli_clock_min_diff( dtime_save, dtime );
}//nrepeats
dtime_save = bli_clock_min_diff(dtime_save, dtime);
} // nrepeats
gflops = ( 2.0 * m * k * n ) / ( dtime_save * 1.0e9 );
if (bli_is_dcomplex(dt) && (bli_is_double(dt_a)))
gflops *= 2.0;
else if ( bli_is_complex( dt ) ) gflops *= 4.0;
gflops = (2.0 * m * k * n) / (dtime_save * 1.0e9);
if (bli_is_dcomplex(dt) && (bli_is_double(dt_a)))
gflops *= 2.0;
else if (bli_is_complex(dt))
gflops *= 4.0;
#ifdef BLIS
printf("data_gemm_blis" );
printf("data_gemm_blis");
#else
printf("data_gemm_%s", BLAS );
printf("data_gemm_%s", BLAS);
#endif
#ifdef FILE_IN_OUT
printf("%6lu \t %4lu \t %4lu \t %4lu \t %4lu \t %4lu \t %6.3f\n", \
( unsigned long )m,( unsigned long )k,( unsigned long )n,
(unsigned long)lda,(unsigned long)ldb,(unsigned long)ldc,gflops);
printf("%6lu \t %4lu \t %4lu \t %4lu \t %4lu \t %4lu \t %6.3f\n",
(unsigned long)m, (unsigned long)k, (unsigned long)n,
(unsigned long)lda, (unsigned long)ldb, (unsigned long)ldc, gflops);
fprintf(fout, "%6lu \t %4lu \t %4lu \t %4lu \t %4lu \t %4lu \t %6.3f\n", \
( unsigned long )m,( unsigned long )k,( unsigned long )n,
(unsigned long)lda,(unsigned long)ldb,(unsigned long)ldc,gflops);
fflush(fout);
fprintf(fout, "%6lu \t %4lu \t %4lu \t %4lu \t %4lu \t %4lu \t %6.3f\n",
(unsigned long)m, (unsigned long)k, (unsigned long)n,
(unsigned long)lda, (unsigned long)ldb, (unsigned long)ldc, gflops);
fflush(fout);
#else
printf( "( %2lu, 1:4 ) = [ %4lu %4lu %4lu %7.2f ];\n",
( unsigned long )(p - p_begin)/p_inc + 1,
( unsigned long )m,( unsigned long )k,
( unsigned long )n, gflops );
printf("( %2lu, 1:4 ) = [ %4lu %4lu %4lu %7.2f ];\n",
(unsigned long)(p - p_begin) / p_inc + 1,
(unsigned long)m, (unsigned long)k,
(unsigned long)n, gflops);
#endif
bli_obj_free( &alpha );
bli_obj_free( &beta );
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 );
}//while
bli_obj_free(&a);
bli_obj_free(&b);
bli_obj_free(&c);
bli_obj_free(&c_save);
} // while
//bli_finalize();
// bli_finalize();
#ifdef FILE_IN_OUT
fclose(fin);
fclose(fout);
fclose(fin);
fclose(fout);
#endif
return 0;
return 0;
}

689
test/test_trsm.c
View File

@@ -5,19 +5,19 @@
libraries.
Copyright (C) 2014, The University of Texas at Austin
Copyright (C) 2020-2021, Advanced Micro Devices, Inc.
Copyright (C) 2020-2022, 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.
- 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
@@ -50,14 +50,31 @@
#define CACHE_LINE_SIZE 64
int main( int argc, char** argv )
// Uncomment to enable progress printing.
//#define PROGRESS_ENABLED
#ifdef PROGRESS_ENABLED
dim_t AOCL_progress(char *api,
dim_t lapi,
dim_t progress,
dim_t current_thread,
dim_t total_threads)
{
printf("\n%s, len = %ld, nt = %ld, tid = %ld, Processed %ld Elements",
api, lapi, total_threads, current_thread, progress);
return 0;
}
#endif
int main(int argc, char **argv)
{
obj_t a, c;
obj_t c_save;
obj_t alpha;
dim_t m, n;
num_t dt;
int r, n_repeats;
int r, n_repeats;
side_t side;
uplo_t uploa;
trans_t transa;
@@ -72,16 +89,20 @@ int main( int argc, char** argv )
double gflops;
#ifdef FILE_IN_OUT
FILE* fin = NULL;
FILE* fout = NULL;
FILE *fin = NULL;
FILE *fout = NULL;
#else
dim_t p;
dim_t p_begin, p_end, p_inc;
int m_input, n_input;
int m_input, n_input;
//bli_init();
#ifdef PROGRESS_ENABLED
AOCL_BLIS_set_progress(AOCL_progress);
#endif
//bli_error_checking_level_set( BLIS_NO_ERROR_CHECKING );
// bli_init();
// bli_error_checking_level_set( BLIS_NO_ERROR_CHECKING );
#ifndef PRINT
p_begin = 200;
@@ -102,26 +123,26 @@ int main( int argc, char** argv )
n_repeats = 3;
//dt = BLIS_FLOAT;
// dt = BLIS_FLOAT;
dt = BLIS_DOUBLE;
//dt = BLIS_SCOMPLEX;
//dt = BLIS_DCOMPLEX;
// dt = BLIS_SCOMPLEX;
// dt = BLIS_DCOMPLEX;
#ifdef FILE_IN_OUT
if(argc < 3)
if (argc < 3)
{
printf("Usage: ./test_trsm_XX.x input.csv output.csv\n");
exit(1);
}
fin = fopen(argv[1], "r");
if(fin == NULL)
if (fin == NULL)
{
printf("Error opening the file %s\n", argv[1]);
exit(1);
}
fout = fopen(argv[2], "w");
if(fout == NULL)
if (fout == NULL)
{
printf("Error opening the file %s\n", argv[2]);
exit(1);
@@ -130,425 +151,421 @@ int main( int argc, char** argv )
inc_t cs_b;
#ifdef READ_ALL_PARAMS_FROM_FILE
char side_c, uploa_c, transa_c, diaga_c;
fprintf(fout, "side, uploa, transa, diaga, m\t n\t cs_a\t cs_b\t gflops\n");
printf("~~~~~~~_BLAS\t side, uploa, transa, diaga, m\t n\t cs_a\t cs_b\t gflops\n");
while(fscanf(fin, "%c %c %c %c %ld %ld %ld %ld\n", &side_c, &uploa_c, &transa_c, &diaga_c, &m, &n, &cs_a, &cs_b) == 8)
while (fscanf(fin, "%c %c %c %c %ld %ld %ld %ld\n", &side_c, &uploa_c, &transa_c, &diaga_c, &m, &n, &cs_a, &cs_b) == 8)
{
if( 'l' == side_c|| 'L' == side_c)
side = BLIS_LEFT;
else if('r' == side_c || 'R' == side_c)
side = BLIS_RIGHT;
else
{
printf("Invalid entry for the argument 'side':%c\n",side_c);
continue;
}
if ('l' == side_c || 'L' == side_c)
side = BLIS_LEFT;
else if ('r' == side_c || 'R' == side_c)
side = BLIS_RIGHT;
else
{
printf("Invalid entry for the argument 'side':%c\n", side_c);
continue;
}
if('l' == uploa_c || 'L' == uploa_c)
uploa = BLIS_LOWER;
else if('u' == uploa_c || 'U' == uploa_c)
uploa = BLIS_UPPER;
else
{
printf("Invalid entry for the argument 'uplo':%c\n",uploa_c);
continue;
}
if ('l' == uploa_c || 'L' == uploa_c)
uploa = BLIS_LOWER;
else if ('u' == uploa_c || 'U' == uploa_c)
uploa = BLIS_UPPER;
else
{
printf("Invalid entry for the argument 'uplo':%c\n", uploa_c);
continue;
}
if('t' == transa_c || 'T' == transa_c)
transa = BLIS_TRANSPOSE;
else if('n' == transa_c || 'N' == transa_c)
transa = BLIS_NO_TRANSPOSE;
else
{
printf("Invalid entry for the argument 'transa':%c\n",transa_c);
continue;
}
if('u' == diaga_c || 'U' == diaga_c)
diaga = BLIS_UNIT_DIAG;
else if('n' == diaga_c || 'N' == diaga_c)
diaga = BLIS_NONUNIT_DIAG;
else
{
printf("Invalid entry for the argument 'diaga':%c\n", diaga_c);
continue;
}
if ('t' == transa_c || 'T' == transa_c)
transa = BLIS_TRANSPOSE;
else if ('n' == transa_c || 'N' == transa_c)
transa = BLIS_NO_TRANSPOSE;
else
{
printf("Invalid entry for the argument 'transa':%c\n", transa_c);
continue;
}
if ('u' == diaga_c || 'U' == diaga_c)
diaga = BLIS_UNIT_DIAG;
else if ('n' == diaga_c || 'N' == diaga_c)
diaga = BLIS_NONUNIT_DIAG;
else
{
printf("Invalid entry for the argument 'diaga':%c\n", diaga_c);
continue;
}
#else
fprintf(fout, "m\t n\t cs_a\t cs_b\t gflops\n");
printf("~~~~~~~_BLAS\t m\t n\t cs_a\t cs_b\t gflops\n");
while(fscanf(fin, "%ld %ld %ld %ld\n", &m, &n, &cs_a, &cs_b) == 4)
while (fscanf(fin, "%ld %ld %ld %ld\n", &m, &n, &cs_a, &cs_b) == 4)
{
side = BLIS_LEFT;
//side = BLIS_RIGHT;
uploa = BLIS_LOWER;
//uploa = BLIS_UPPER;
side = BLIS_LEFT;
// side = BLIS_RIGHT;
transa = BLIS_NO_TRANSPOSE;
uploa = BLIS_LOWER;
// uploa = BLIS_UPPER;
diaga = BLIS_NONUNIT_DIAG;
transa = BLIS_NO_TRANSPOSE;
diaga = BLIS_NONUNIT_DIAG;
#endif
bli_param_map_blis_to_netlib_side( side, &f77_side );
bli_param_map_blis_to_netlib_uplo( uploa, &f77_uploa );
bli_param_map_blis_to_netlib_trans( transa, &f77_transa );
bli_param_map_blis_to_netlib_diag( diaga, &f77_diaga );
bli_param_map_blis_to_netlib_side(side, &f77_side);
bli_param_map_blis_to_netlib_uplo(uploa, &f77_uploa);
bli_param_map_blis_to_netlib_trans(transa, &f77_transa);
bli_param_map_blis_to_netlib_diag(diaga, &f77_diaga);
siz_t elem_size = bli_dt_size(dt);
siz_t elem_size = bli_dt_size( dt );
cs_a = bli_align_dim_to_size(cs_a, elem_size, BLIS_HEAP_STRIDE_ALIGN_SIZE);
cs_b = bli_align_dim_to_size(cs_b, elem_size, BLIS_HEAP_STRIDE_ALIGN_SIZE);
cs_a = bli_align_dim_to_size( cs_a, elem_size, BLIS_HEAP_STRIDE_ALIGN_SIZE );
cs_b = bli_align_dim_to_size( cs_b, elem_size, BLIS_HEAP_STRIDE_ALIGN_SIZE );
// Will verify the leading dimension is powers of 2 and add 64bytes.
inc_t n_bytes = cs_a * sizeof(dt);
//Will verify the leading dimension is powers of 2 and add 64bytes.
inc_t n_bytes = cs_a*sizeof(dt);
if ((n_bytes != 0) && !(n_bytes & (n_bytes - 1))) // check whether n_bytes is power of 2.
cs_a += CACHE_LINE_SIZE / sizeof(dt);
if((n_bytes!=0) && !(n_bytes&(n_bytes-1)))// check whether n_bytes is power of 2.
cs_a += CACHE_LINE_SIZE/sizeof(dt);
n_bytes = cs_b * sizeof(dt);
if ((n_bytes != 0) && !(n_bytes & (n_bytes - 1))) // check whether n_bytes is power of 2.
cs_b += CACHE_LINE_SIZE / sizeof(dt);
n_bytes = cs_b*sizeof(dt);
if((n_bytes!=0) && !(n_bytes&(n_bytes-1)))// check whether n_bytes is power of 2.
cs_b += CACHE_LINE_SIZE/sizeof(dt);
if (bli_is_left(side) && ((m > cs_a) || (m > cs_b)))
continue; // leading dimension should be greater than number of rows
if (bli_is_right(side) && ((n > cs_a) || (m > cs_b)))
continue; // leading dimension should be greater than number of rows
if(bli_is_left(side) && ((m > cs_a) || (m > cs_b))) continue; //leading dimension should be greater than number of rows
if(bli_is_right(side) && ((n > cs_a) || (m > cs_b))) continue; //leading dimension should be greater than number of rows
if ( bli_is_left( side ) )
bli_obj_create( dt, m, m, 1, m, &a );
if (bli_is_left(side))
bli_obj_create(dt, m, m, 1, m, &a);
else
bli_obj_create( dt, n, n, 1, n, &a );
bli_obj_create( dt, m, n, 1, m, &c );
bli_obj_create( dt, m, n, 1, m, &c_save );
bli_obj_create(dt, n, n, 1, n, &a);
bli_obj_create(dt, m, n, 1, m, &c);
bli_obj_create(dt, m, n, 1, m, &c_save);
#else
for ( p = p_end; p >= p_begin; p -= p_inc )
for (p = p_end; p >= p_begin; 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;
side = BLIS_LEFT;
//side = BLIS_RIGHT;
uploa = BLIS_LOWER;
//uploa = BLIS_UPPER;
transa = BLIS_NO_TRANSPOSE;
diaga = BLIS_NONUNIT_DIAG;
bli_param_map_blis_to_netlib_side( side, &f77_side );
bli_param_map_blis_to_netlib_uplo( uploa, &f77_uploa );
bli_param_map_blis_to_netlib_trans( transa, &f77_transa );
bli_param_map_blis_to_netlib_diag( diaga, &f77_diaga );
if ( bli_is_left( side ) )
bli_obj_create( dt, m, m, 0, 0, &a );
if (m_input < 0)
m = p * (dim_t)abs(m_input);
else
bli_obj_create( dt, n, n, 0, 0, &a );
bli_obj_create( dt, m, n, 0, 0, &c );
bli_obj_create( dt, m, n, 0, 0, &c_save );
m = (dim_t)m_input;
if (n_input < 0)
n = p * (dim_t)abs(n_input);
else
n = (dim_t)n_input;
side = BLIS_LEFT;
// side = BLIS_RIGHT;
uploa = BLIS_LOWER;
// uploa = BLIS_UPPER;
transa = BLIS_NO_TRANSPOSE;
diaga = BLIS_NONUNIT_DIAG;
bli_param_map_blis_to_netlib_side(side, &f77_side);
bli_param_map_blis_to_netlib_uplo(uploa, &f77_uploa);
bli_param_map_blis_to_netlib_trans(transa, &f77_transa);
bli_param_map_blis_to_netlib_diag(diaga, &f77_diaga);
if (bli_is_left(side))
bli_obj_create(dt, m, m, 0, 0, &a);
else
bli_obj_create(dt, n, n, 0, 0, &a);
bli_obj_create(dt, m, n, 0, 0, &c);
bli_obj_create(dt, m, n, 0, 0, &c_save);
#endif
bli_randm( &a );
bli_randm( &c );
bli_randm(&a);
bli_randm(&c);
bli_obj_set_struc( BLIS_TRIANGULAR, &a );
bli_obj_set_uplo( uploa, &a );
bli_obj_set_conjtrans( transa, &a );
bli_obj_set_diag( diaga, &a );
bli_obj_set_struc(BLIS_TRIANGULAR, &a);
bli_obj_set_uplo(uploa, &a);
bli_obj_set_conjtrans(transa, &a);
bli_obj_set_diag(diaga, &a);
// Randomize A and zero the unstored triangle to ensure the
// implementation reads only from the stored region.
bli_randm( &a );
bli_mktrim( &a );
bli_randm(&a);
bli_mktrim(&a);
// Load the diagonal of A to make it more likely to be invertible.
bli_shiftd( &BLIS_TWO, &a );
bli_shiftd(&BLIS_TWO, &a);
bli_obj_create( dt, 1, 1, 0, 0, &alpha );
bli_setsc( (2.0/1.0), 1.0, &alpha );
bli_obj_create(dt, 1, 1, 0, 0, &alpha);
bli_setsc((2.0 / 1.0), 1.0, &alpha);
bli_copym(&c, &c_save);
bli_copym( &c, &c_save );
dtime_save = DBL_MAX;
for ( r = 0; r < n_repeats; ++r )
for (r = 0; r < n_repeats; ++r)
{
bli_copym( &c_save, &c );
bli_copym(&c_save, &c);
dtime = bli_clock();
#ifdef PRINT
bli_invertd( &a );
bli_printm( "a", &a, "%4.1f", "" );
bli_invertd( &a );
bli_printm( "c", &c, "%4.1f", "" );
bli_invertd(&a);
bli_printm("a", &a, "%4.1f", "");
bli_invertd(&a);
bli_printm("c", &c, "%4.1f", "");
#endif
#ifdef BLIS
bli_trsm( side,
&alpha,
&a,
&c );
bli_trsm(side,
&alpha,
&a,
&c);
#else
#ifdef CBLAS
enum CBLAS_ORDER cblas_order;
enum CBLAS_TRANSPOSE cblas_transa;
enum CBLAS_UPLO cblas_uplo;
enum CBLAS_SIDE cblas_side;
enum CBLAS_DIAG cblas_diag;
enum CBLAS_ORDER cblas_order;
enum CBLAS_TRANSPOSE cblas_transa;
enum CBLAS_UPLO cblas_uplo;
enum CBLAS_SIDE cblas_side;
enum CBLAS_DIAG cblas_diag;
if ( bli_obj_row_stride( &c ) == 1 )
cblas_order = CblasColMajor;
else
cblas_order = CblasRowMajor;
if (bli_obj_row_stride(&c) == 1)
cblas_order = CblasColMajor;
else
cblas_order = CblasRowMajor;
if( bli_is_trans( transa ) )
cblas_transa = CblasTrans;
else if( bli_is_conjtrans( transa ) )
cblas_transa = CblasConjTrans;
else
cblas_transa = CblasNoTrans;
if (bli_is_trans(transa))
cblas_transa = CblasTrans;
else if (bli_is_conjtrans(transa))
cblas_transa = CblasConjTrans;
else
cblas_transa = CblasNoTrans;
if(bli_is_upper(uploa))
cblas_uplo = CblasUpper;
else
cblas_uplo = CblasLower;
if (bli_is_upper(uploa))
cblas_uplo = CblasUpper;
else
cblas_uplo = CblasLower;
if(bli_is_left(side))
cblas_side = CblasLeft;
else
cblas_side = CblasRight;
if (bli_is_left(side))
cblas_side = CblasLeft;
else
cblas_side = CblasRight;
if(bli_is_unit_diag(diaga))
cblas_diag = CblasUnit;
else
cblas_diag = CblasNonUnit;
if (bli_is_unit_diag(diaga))
cblas_diag = CblasUnit;
else
cblas_diag = CblasNonUnit;
#else
f77_char f77_transa;
bli_param_map_blis_to_netlib_trans( transa, &f77_transa );
f77_char f77_transa;
bli_param_map_blis_to_netlib_trans(transa, &f77_transa);
#endif
if ( bli_is_float( dt ) )
{
f77_int mm = bli_obj_length( &c );
f77_int nn = bli_obj_width( &c );
f77_int lda = bli_obj_col_stride( &a );
f77_int ldc = bli_obj_col_stride( &c );
if (bli_is_float(dt))
{
f77_int mm = bli_obj_length(&c);
f77_int nn = bli_obj_width(&c);
f77_int lda = bli_obj_col_stride(&a);
f77_int ldc = bli_obj_col_stride(&c);
float* alphap = bli_obj_buffer( &alpha );
float* ap = bli_obj_buffer( &a );
float* cp = bli_obj_buffer( &c );
float *alphap = bli_obj_buffer(&alpha);
float *ap = bli_obj_buffer(&a);
float *cp = bli_obj_buffer(&c);
#ifdef CBLAS
cblas_strsm( cblas_order,
cblas_side,
cblas_uplo,
cblas_transa,
cblas_diag,
mm,
nn,
*alphap,
ap, lda,
cp, ldc
);
cblas_strsm(cblas_order,
cblas_side,
cblas_uplo,
cblas_transa,
cblas_diag,
mm,
nn,
*alphap,
ap, lda,
cp, ldc);
#else
strsm_( &f77_side,
&f77_uploa,
&f77_transa,
&f77_diaga,
&mm,
&nn,
alphap,
ap, &lda,
cp, &ldc );
strsm_(&f77_side,
&f77_uploa,
&f77_transa,
&f77_diaga,
&mm,
&nn,
alphap,
ap, &lda,
cp, &ldc);
#endif
}
else if ( bli_is_double( dt ) )
{
f77_int mm = bli_obj_length( &c );
f77_int nn = bli_obj_width( &c );
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* cp = bli_obj_buffer( &c );
}
else if (bli_is_double(dt))
{
f77_int mm = bli_obj_length(&c);
f77_int nn = bli_obj_width(&c);
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 *cp = bli_obj_buffer(&c);
#ifdef CBLAS
cblas_dtrsm( cblas_order,
cblas_side,
cblas_uplo,
cblas_transa,
cblas_diag,
mm,
nn,
*alphap,
ap, lda,
cp, ldc
);
#else
dtrsm_( &f77_side,
&f77_uploa,
&f77_transa,
&f77_diaga,
&mm,
&nn,
alphap,
ap, &lda,
cp, &ldc );
#endif
}
else if ( bli_is_scomplex( dt ) )
{
f77_int mm = bli_obj_length( &c );
f77_int nn = bli_obj_width( &c );
f77_int lda = bli_obj_col_stride( &a );
f77_int ldc = bli_obj_col_stride( &c );
scomplex* alphap = bli_obj_buffer( &alpha );
scomplex* ap = bli_obj_buffer( &a );
scomplex* cp = bli_obj_buffer( &c );
#ifdef CBLAS
cblas_ctrsm( cblas_order,
cblas_side,
cblas_uplo,
cblas_transa,
cblas_diag,
mm,
nn,
alphap,
ap, lda,
cp, ldc
);
cblas_dtrsm(cblas_order,
cblas_side,
cblas_uplo,
cblas_transa,
cblas_diag,
mm,
nn,
*alphap,
ap, lda,
cp, ldc);
#else
ctrsm_( &f77_side,
&f77_uploa,
&f77_transa,
&f77_diaga,
&mm,
&nn,
alphap,
ap, &lda,
cp, &ldc );
dtrsm_(&f77_side,
&f77_uploa,
&f77_transa,
&f77_diaga,
&mm,
&nn,
alphap,
ap, &lda,
cp, &ldc);
#endif
}
else if ( bli_is_dcomplex( dt ) )
{
f77_int mm = bli_obj_length( &c );
f77_int nn = bli_obj_width( &c );
f77_int lda = bli_obj_col_stride( &a );
f77_int ldc = bli_obj_col_stride( &c );
dcomplex* alphap = bli_obj_buffer( &alpha );
dcomplex* ap = bli_obj_buffer( &a );
dcomplex* cp = bli_obj_buffer( &c );
}
else if (bli_is_scomplex(dt))
{
f77_int mm = bli_obj_length(&c);
f77_int nn = bli_obj_width(&c);
f77_int lda = bli_obj_col_stride(&a);
f77_int ldc = bli_obj_col_stride(&c);
scomplex *alphap = bli_obj_buffer(&alpha);
scomplex *ap = bli_obj_buffer(&a);
scomplex *cp = bli_obj_buffer(&c);
#ifdef CBLAS
cblas_ztrsm( cblas_order,
cblas_side,
cblas_uplo,
cblas_transa,
cblas_diag,
mm,
nn,
alphap,
ap, lda,
cp, ldc
);
cblas_ctrsm(cblas_order,
cblas_side,
cblas_uplo,
cblas_transa,
cblas_diag,
mm,
nn,
alphap,
ap, lda,
cp, ldc);
#else
ztrsm_( &f77_side,
&f77_uploa,
&f77_transa,
&f77_diaga,
&mm,
&nn,
alphap,
ap, &lda,
cp, &ldc );
ctrsm_(&f77_side,
&f77_uploa,
&f77_transa,
&f77_diaga,
&mm,
&nn,
alphap,
ap, &lda,
cp, &ldc);
#endif
}else{
printf("Invalid data type! Exiting!\n");
exit(1);
}
}
else if (bli_is_dcomplex(dt))
{
f77_int mm = bli_obj_length(&c);
f77_int nn = bli_obj_width(&c);
f77_int lda = bli_obj_col_stride(&a);
f77_int ldc = bli_obj_col_stride(&c);
dcomplex *alphap = bli_obj_buffer(&alpha);
dcomplex *ap = bli_obj_buffer(&a);
dcomplex *cp = bli_obj_buffer(&c);
#ifdef CBLAS
cblas_ztrsm(cblas_order,
cblas_side,
cblas_uplo,
cblas_transa,
cblas_diag,
mm,
nn,
alphap,
ap, lda,
cp, ldc);
#else
ztrsm_(&f77_side,
&f77_uploa,
&f77_transa,
&f77_diaga,
&mm,
&nn,
alphap,
ap, &lda,
cp, &ldc);
#endif
}
else
{
printf("Invalid data type! Exiting!\n");
exit(1);
}
#endif
dtime_save = bli_clock_min_diff( dtime_save, dtime );
dtime_save = bli_clock_min_diff(dtime_save, dtime);
}
if ( bli_is_left( side ) )
gflops = ( 1.0 * m * m * n ) / ( dtime_save * 1.0e9 );
if (bli_is_left(side))
gflops = (1.0 * m * m * n) / (dtime_save * 1.0e9);
else
gflops = ( 1.0 * m * n * n ) / ( dtime_save * 1.0e9 );
gflops = (1.0 * m * n * n) / (dtime_save * 1.0e9);
if ( bli_is_complex( dt ) ) gflops *= 4.0;
if (bli_is_complex(dt))
gflops *= 4.0;
#ifdef BLIS
printf( "data_trsm_blis" );
printf("data_trsm_blis");
#else
printf( "data_trsm_%s", BLAS );
printf("data_trsm_%s", BLAS);
#endif
#ifdef FILE_IN_OUT
#ifdef READ_ALL_PARAMS_FROM_FILE
printf("%c\t %c\t %c\t %c\t %4lu\t %4lu\t %4lu\t %4lu\t %6.3f\n",side_c, uploa_c, transa_c, diaga_c,
(unsigned long )m, (unsigned long ) n,
(unsigned long )cs_a, (unsigned long )cs_b,
gflops);
printf("%c\t %c\t %c\t %c\t %4lu\t %4lu\t %4lu\t %4lu\t %6.3f\n", side_c, uploa_c, transa_c, diaga_c,
(unsigned long)m, (unsigned long)n,
(unsigned long)cs_a, (unsigned long)cs_b,
gflops);
fprintf(fout,"%c\t %c\t %c\t %c\t %4lu\t %4lu\t %4lu\t %4lu\t %6.3f\n", side_c, uploa_c, transa_c, diaga_c,
(unsigned long )m, (unsigned long ) n,
(unsigned long )cs_a, (unsigned long )cs_b,
gflops);
fprintf(fout, "%c\t %c\t %c\t %c\t %4lu\t %4lu\t %4lu\t %4lu\t %6.3f\n", side_c, uploa_c, transa_c, diaga_c,
(unsigned long)m, (unsigned long)n,
(unsigned long)cs_a, (unsigned long)cs_b,
gflops);
#else
printf("%4lu\t %4lu\t %4lu\t %4lu\t %6.3f\n", (unsigned long )m, (unsigned long ) n,
(unsigned long )cs_a, (unsigned long )cs_b,
gflops);
fprintf(fout,"%4lu\t %4lu\t %4lu\t %4lu\t %6.3f\n", (unsigned long )m, (unsigned long ) n,
(unsigned long )cs_a, (unsigned long )cs_b,
gflops);
printf("%4lu\t %4lu\t %4lu\t %4lu\t %6.3f\n", (unsigned long)m, (unsigned long)n,
(unsigned long)cs_a, (unsigned long)cs_b,
gflops);
fprintf(fout, "%4lu\t %4lu\t %4lu\t %4lu\t %6.3f\n", (unsigned long)m, (unsigned long)n,
(unsigned long)cs_a, (unsigned long)cs_b,
gflops);
#endif
fflush(fout);
fflush(fout);
#else
printf( "( %2lu, 1:3 ) = [ %4lu %4lu %7.2f ];\n",
( unsigned long )(p - p_begin)/p_inc + 1,
( unsigned long )m,
( unsigned long )n, gflops );
printf("( %2lu, 1:3 ) = [ %4lu %4lu %7.2f ];\n",
(unsigned long)(p - p_begin) / p_inc + 1,
(unsigned long)m,
(unsigned long)n, gflops);
#endif
bli_obj_free( &alpha );
bli_obj_free(&alpha);
bli_obj_free( &a );
bli_obj_free( &c );
bli_obj_free( &c_save );
bli_obj_free(&a);
bli_obj_free(&c);
bli_obj_free(&c_save);
}
#ifdef FILE_IN_OUT
fclose(fin);
fclose(fout);
fclose(fin);
fclose(fout);
#endif
//bli_finalize();
// bli_finalize();
return 0;
}