mirror of
https://github.com/amd/blis.git
synced 2026-05-04 22:41:11 +00:00
6b83273126
Details: - Replaced direct usage of _Pragma( "omp simd" ) in reference kernels with PRAGMA_SIMD, which is defined as a function of the compiler being used in a new bli_pragma_macro_defs.h file. That definition is cleared when BLIS detects that the -fopenmp-simd command line option is unsupported. Thanks to Devin Matthews and Jeff Hammond for suggestions that guided this commit. - Updated configure and bli_config.h.in so that the appropriate anchor is substituted in (when the corresponding pragma omp simd support is present).
271 lines
7.3 KiB
C
271 lines
7.3 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(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"
|
|
|
|
#if 1
|
|
|
|
// An implementation that attempts to facilitate emission of vectorized
|
|
// instructions via constant loop bounds + #pragma omp simd directives.
|
|
|
|
#undef GENTFUNC
|
|
#define GENTFUNC( ctype, ch, opname, arch, suf, mr, nr ) \
|
|
\
|
|
void PASTEMAC3(ch,opname,arch,suf) \
|
|
( \
|
|
dim_t k, \
|
|
ctype* restrict alpha, \
|
|
ctype* restrict a, \
|
|
ctype* restrict b, \
|
|
ctype* restrict beta, \
|
|
ctype* restrict c, inc_t rs_c, inc_t cs_c, \
|
|
auxinfo_t* restrict data, \
|
|
cntx_t* restrict cntx \
|
|
) \
|
|
{ \
|
|
ctype ab[ BLIS_STACK_BUF_MAX_SIZE \
|
|
/ sizeof( ctype ) ] \
|
|
__attribute__((aligned(BLIS_STACK_BUF_ALIGN_SIZE))); \
|
|
const inc_t rs_ab = nr; \
|
|
const inc_t cs_ab = 1; \
|
|
\
|
|
const inc_t cs_a = mr; \
|
|
const inc_t rs_b = nr; \
|
|
\
|
|
\
|
|
/* Initialize the accumulator elements in ab to zero. */ \
|
|
PRAGMA_SIMD \
|
|
for ( dim_t i = 0; i < mr * nr; ++i ) \
|
|
{ \
|
|
PASTEMAC(ch,set0s)( ab[ i ] ); \
|
|
} \
|
|
\
|
|
/* Perform a series of k rank-1 updates into ab. */ \
|
|
for ( dim_t l = 0; l < k; ++l ) \
|
|
{ \
|
|
for ( dim_t i = 0; i < mr; ++i ) \
|
|
{ \
|
|
PRAGMA_SIMD \
|
|
for ( dim_t j = 0; j < nr; ++j ) \
|
|
{ \
|
|
PASTEMAC(ch,dots) \
|
|
( \
|
|
a[ i ], \
|
|
b[ j ], \
|
|
ab[ i*rs_ab + j*cs_ab ] \
|
|
); \
|
|
} \
|
|
} \
|
|
\
|
|
a += cs_a; \
|
|
b += rs_b; \
|
|
} \
|
|
\
|
|
/* Scale the result in ab by alpha. */ \
|
|
PRAGMA_SIMD \
|
|
for ( dim_t i = 0; i < mr * nr; ++i ) \
|
|
{ \
|
|
PASTEMAC(ch,scals)( *alpha, ab[ i ] ); \
|
|
} \
|
|
\
|
|
/* Output/accumulate intermediate result ab based on the storage
|
|
of c and the value of beta. */ \
|
|
if ( cs_c == 1 ) \
|
|
{ \
|
|
/* C is row-stored. */ \
|
|
\
|
|
if ( PASTEMAC(ch,eq0)( *beta ) ) \
|
|
{ \
|
|
for ( dim_t i = 0; i < mr; ++i ) \
|
|
for ( dim_t j = 0; j < nr; ++j ) \
|
|
PASTEMAC(ch,copys) \
|
|
( \
|
|
ab[ i*rs_ab + j*cs_ab ], \
|
|
c [ i*rs_c + j*1 ] \
|
|
); \
|
|
} \
|
|
else \
|
|
{ \
|
|
for ( dim_t i = 0; i < mr; ++i ) \
|
|
for ( dim_t j = 0; j < nr; ++j ) \
|
|
PASTEMAC(ch,xpbys) \
|
|
( \
|
|
ab[ i*rs_ab + j*cs_ab ], \
|
|
*beta, \
|
|
c [ i*rs_c + j*1 ] \
|
|
); \
|
|
} \
|
|
} \
|
|
else \
|
|
{ \
|
|
/* C is column-stored or general-stored. */ \
|
|
\
|
|
if ( PASTEMAC(ch,eq0)( *beta ) ) \
|
|
{ \
|
|
for ( dim_t j = 0; j < nr; ++j ) \
|
|
for ( dim_t i = 0; i < mr; ++i ) \
|
|
PASTEMAC(ch,copys) \
|
|
( \
|
|
ab[ i*rs_ab + j*cs_ab ], \
|
|
c [ i*rs_c + j*cs_c ] \
|
|
); \
|
|
} \
|
|
else \
|
|
{ \
|
|
for ( dim_t j = 0; j < nr; ++j ) \
|
|
for ( dim_t i = 0; i < mr; ++i ) \
|
|
PASTEMAC(ch,xpbys) \
|
|
( \
|
|
ab[ i*rs_ab + j*cs_ab ], \
|
|
*beta, \
|
|
c [ i*rs_c + j*cs_c ] \
|
|
); \
|
|
} \
|
|
} \
|
|
}
|
|
|
|
//INSERT_GENTFUNC_BASIC2( gemm, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX )
|
|
GENTFUNC( float, s, gemm, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX, 4, 16 )
|
|
GENTFUNC( double, d, gemm, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX, 4, 8 )
|
|
GENTFUNC( scomplex, c, gemm, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX, 4, 8 )
|
|
GENTFUNC( dcomplex, z, gemm, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX, 4, 4 )
|
|
|
|
#else
|
|
|
|
// An implementation that uses variable loop bounds (queried from the context)
|
|
// and makes no use of #pragma omp simd.
|
|
|
|
#undef GENTFUNC
|
|
#define GENTFUNC( ctype, ch, opname, arch, suf ) \
|
|
\
|
|
void PASTEMAC3(ch,opname,arch,suf) \
|
|
( \
|
|
dim_t k, \
|
|
ctype* restrict alpha, \
|
|
ctype* restrict a, \
|
|
ctype* restrict b, \
|
|
ctype* restrict beta, \
|
|
ctype* restrict c, inc_t rs_c, inc_t cs_c, \
|
|
auxinfo_t* restrict data, \
|
|
cntx_t* restrict cntx \
|
|
) \
|
|
{ \
|
|
const num_t dt = PASTEMAC(ch,type); \
|
|
\
|
|
const dim_t mr = bli_cntx_get_blksz_def_dt( dt, BLIS_MR, cntx ); \
|
|
const dim_t nr = bli_cntx_get_blksz_def_dt( dt, BLIS_NR, cntx ); \
|
|
\
|
|
const inc_t packmr = bli_cntx_get_blksz_max_dt( dt, BLIS_MR, cntx ); \
|
|
const inc_t packnr = bli_cntx_get_blksz_max_dt( dt, BLIS_NR, cntx ); \
|
|
\
|
|
const dim_t m = mr; \
|
|
const dim_t n = nr; \
|
|
\
|
|
const inc_t cs_a = packmr; \
|
|
\
|
|
const inc_t rs_b = packnr; \
|
|
\
|
|
ctype ab[ BLIS_STACK_BUF_MAX_SIZE \
|
|
/ sizeof( ctype ) ] \
|
|
__attribute__((aligned(BLIS_STACK_BUF_ALIGN_SIZE))); \
|
|
const inc_t rs_ab = 1; \
|
|
const inc_t cs_ab = mr; \
|
|
\
|
|
dim_t l, j, i; \
|
|
\
|
|
ctype ai; \
|
|
ctype bj; \
|
|
\
|
|
\
|
|
/* Initialize the accumulator elements in ab to zero. */ \
|
|
for ( i = 0; i < m * n; ++i ) \
|
|
{ \
|
|
PASTEMAC(ch,set0s)( *(ab + i) ); \
|
|
} \
|
|
\
|
|
/* Perform a series of k rank-1 updates into ab. */ \
|
|
for ( l = 0; l < k; ++l ) \
|
|
{ \
|
|
ctype* restrict abij = ab; \
|
|
\
|
|
/* In an optimized implementation, these two loops over MR and NR
|
|
are typically fully unrolled. */ \
|
|
for ( j = 0; j < n; ++j ) \
|
|
{ \
|
|
bj = *(b + j); \
|
|
\
|
|
for ( i = 0; i < m; ++i ) \
|
|
{ \
|
|
ai = *(a + i); \
|
|
\
|
|
PASTEMAC(ch,dots)( ai, bj, *abij ); \
|
|
\
|
|
abij += rs_ab; \
|
|
} \
|
|
} \
|
|
\
|
|
a += cs_a; \
|
|
b += rs_b; \
|
|
} \
|
|
\
|
|
/* Scale the result in ab by alpha. */ \
|
|
for ( i = 0; i < m * n; ++i ) \
|
|
{ \
|
|
PASTEMAC(ch,scals)( *alpha, *(ab + i) ); \
|
|
} \
|
|
\
|
|
/* If beta is zero, overwrite c with the scaled result in ab. Otherwise,
|
|
scale by beta and then add the scaled redult in ab. */ \
|
|
if ( PASTEMAC(ch,eq0)( *beta ) ) \
|
|
{ \
|
|
PASTEMAC(ch,copys_mxn)( m, \
|
|
n, \
|
|
ab, rs_ab, cs_ab, \
|
|
c, rs_c, cs_c ); \
|
|
} \
|
|
else \
|
|
{ \
|
|
PASTEMAC(ch,xpbys_mxn)( m, \
|
|
n, \
|
|
ab, rs_ab, cs_ab, \
|
|
beta, \
|
|
c, rs_c, cs_c ); \
|
|
} \
|
|
}
|
|
|
|
INSERT_GENTFUNC_BASIC2( gemm, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX )
|
|
|
|
#endif
|
|
|