mirror of
https://github.com/amd/blis.git
synced 2026-04-20 15:48:50 +00:00
BLIS:merge:
Merge conflicts araised has been fixed while downstreaming BLIS code from master to milan-3.1 branch Implemented an automatic reduction in the number of threads when the user requests parallelism via a single number (ie: the automatic way) and (a) that number of threads is prime, and (b) that number exceeds a minimum threshold defined by the macro BLIS_NT_MAX_PRIME, which defaults to 11. If prime numbers are really desired, this feature may be suppressed by defining the macro BLIS_ENABLE_AUTO_PRIME_NUM_THREADS in the appropriate configuration family's bli_family_*.h. (Jeff Diamond) Changed default value of BLIS_THREAD_RATIO_M from 2 to 1, which leads to slightly different automatic thread factorizations. Enable the 1m method only if the real domain microkernel is not a reference kernel. BLIS now forgoes use of 1m if both the real and complex domain kernels are reference implementations. Relocated the general stride handling for gemmsup. This fixed an issue whereby gemm would fail to trigger to conventional code path for cases that use general stride even after gemmsup rejected the problem. (RuQing Xu) Fixed an incorrect function signature (and prototype) of bli_?gemmt(). (RuQing Xu) Redefined BLIS_NUM_ARCHS to be part of the arch_t enum, which means it will be updated automatically when defining future subconfigs. Minor code consolidation in all level-3 _front() functions. Reorganized Windows cpp branch of bli_pthreads.c. Implemented bli_pthread_self() and _equals(), but left them commented out (via cpp guards) due to issues with getting the Windows versions working. Thankfully, these functions aren't yet needed by BLIS. Allow disabling of trsm diagonal pre-inversion at compile time via --disable-trsm-preinversion. Fixed obscure testsuite bug for the gemmt test module that relates to its dependency on gemv. AMD-internal-[CPUPL-1523] Change-Id: I0d1df018e2df96a23dc4383d01d98b324d5ac5cd
This commit is contained in:
lcpu
@@ -38,7 +38,7 @@
|
||||
// elements were broadcast (duplicated) by a factor of NP/NR.
|
||||
|
||||
#undef GENTFUNC
|
||||
#define GENTFUNC( ctype, ch, opname, arch, suf ) \
|
||||
#define GENTFUNC( ctype, ch, opname, arch, suf, diagop ) \
|
||||
\
|
||||
void PASTEMAC3(ch,opname,arch,suf) \
|
||||
( \
|
||||
@@ -103,10 +103,10 @@ void PASTEMAC3(ch,opname,arch,suf) \
|
||||
PASTEMAC(ch,subs)( rho11, beta11c ); \
|
||||
\
|
||||
/* beta11 = beta11 / alpha11; */ \
|
||||
/* NOTE: The INVERSE of alpha11 (1.0/alpha11) is stored instead
|
||||
of alpha11, so we can multiply rather than divide. We store
|
||||
the inverse of alpha11 intentionally to avoid expensive
|
||||
division instructions within the micro-kernel. */ \
|
||||
/* NOTE: When preinversion is enabled, the INVERSE of alpha11
|
||||
(1.0/alpha11) is stored during packing instead alpha11 so we
|
||||
can multiply rather than divide. When preinversion is disabled,
|
||||
alpha11 is stored and division happens below explicitly. */ \
|
||||
PASTEMAC(ch,scals)( *alpha11, beta11c ); \
|
||||
\
|
||||
/* Output final result to matrix c. */ \
|
||||
@@ -118,11 +118,15 @@ void PASTEMAC3(ch,opname,arch,suf) \
|
||||
} \
|
||||
}
|
||||
|
||||
INSERT_GENTFUNC_BASIC2( trsmbb_l, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX )
|
||||
#ifdef BLIS_ENABLE_TRSM_PREINVERSION
|
||||
INSERT_GENTFUNC_BASIC3( trsmbb_l, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX, scals )
|
||||
#else
|
||||
INSERT_GENTFUNC_BASIC3( trsmbb_l, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX, invscals )
|
||||
#endif
|
||||
|
||||
|
||||
#undef GENTFUNC
|
||||
#define GENTFUNC( ctype, ch, opname, arch, suf ) \
|
||||
#define GENTFUNC( ctype, ch, opname, arch, suf, diagop ) \
|
||||
\
|
||||
void PASTEMAC3(ch,opname,arch,suf) \
|
||||
( \
|
||||
@@ -187,11 +191,11 @@ void PASTEMAC3(ch,opname,arch,suf) \
|
||||
PASTEMAC(ch,subs)( rho11, beta11c ); \
|
||||
\
|
||||
/* beta11 = beta11 / alpha11; */ \
|
||||
/* NOTE: The INVERSE of alpha11 (1.0/alpha11) is stored instead
|
||||
of alpha11, so we can multiply rather than divide. We store
|
||||
the inverse of alpha11 intentionally to avoid expensive
|
||||
division instructions within the micro-kernel. */ \
|
||||
PASTEMAC(ch,scals)( *alpha11, beta11c ); \
|
||||
/* NOTE: When preinversion is enabled, the INVERSE of alpha11
|
||||
(1.0/alpha11) is stored during packing instead alpha11 so we
|
||||
can multiply rather than divide. When preinversion is disabled,
|
||||
alpha11 is stored and division happens below explicitly. */ \
|
||||
PASTEMAC(ch,diagop)( *alpha11, beta11c ); \
|
||||
\
|
||||
/* Output final result to matrix c. */ \
|
||||
PASTEMAC(ch,copys)( beta11c, *gamma11 ); \
|
||||
@@ -202,5 +206,9 @@ void PASTEMAC3(ch,opname,arch,suf) \
|
||||
} \
|
||||
}
|
||||
|
||||
INSERT_GENTFUNC_BASIC2( trsmbb_u, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX )
|
||||
#ifdef BLIS_ENABLE_TRSM_PREINVERSION
|
||||
INSERT_GENTFUNC_BASIC3( trsmbb_u, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX, scals )
|
||||
#else
|
||||
INSERT_GENTFUNC_BASIC3( trsmbb_u, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX, invscals )
|
||||
#endif
|
||||
|
||||
|
||||
@@ -39,126 +39,7 @@
|
||||
// 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) \
|
||||
( \
|
||||
ctype* restrict a, \
|
||||
ctype* restrict b, \
|
||||
ctype* restrict c, inc_t rs_c, inc_t cs_c, \
|
||||
auxinfo_t* restrict data, \
|
||||
cntx_t* restrict cntx \
|
||||
) \
|
||||
{ \
|
||||
const inc_t rs_a = 1; \
|
||||
const inc_t cs_a = mr; \
|
||||
\
|
||||
const inc_t rs_b = nr; \
|
||||
const inc_t cs_b = 1; \
|
||||
\
|
||||
PRAGMA_SIMD \
|
||||
for ( dim_t i = 0; i < mr; ++i ) \
|
||||
{ \
|
||||
/* b1 = b1 - a10t * B0; */ \
|
||||
/* b1 = b1 / alpha11; */ \
|
||||
for ( dim_t j = 0; j < nr; ++j ) \
|
||||
{ \
|
||||
ctype beta11c = b[i*rs_b + j*cs_b]; \
|
||||
ctype rho11; \
|
||||
\
|
||||
/* beta11 = beta11 - a10t * b01; */ \
|
||||
PASTEMAC(ch,set0s)( rho11 ); \
|
||||
for ( dim_t l = 0; l < i; ++l ) \
|
||||
{ \
|
||||
PASTEMAC(ch,axpys)( a[i*rs_a + l*cs_a], \
|
||||
b[l*rs_b + j*cs_b], rho11 ); \
|
||||
} \
|
||||
PASTEMAC(ch,subs)( rho11, beta11c ); \
|
||||
\
|
||||
/* beta11 = beta11 / alpha11; */ \
|
||||
/* NOTE: The INVERSE of alpha11 (1.0/alpha11) is stored instead
|
||||
of alpha11, so we can multiply rather than divide. We store
|
||||
the inverse of alpha11 intentionally to avoid expensive
|
||||
division instructions within the micro-kernel. */ \
|
||||
PASTEMAC(ch,scals)( a[i*rs_a + i*cs_a], beta11c ); \
|
||||
\
|
||||
/* Output final result to matrix c. */ \
|
||||
PASTEMAC(ch,copys)( beta11c, c[i*rs_c + j*cs_c] ); \
|
||||
\
|
||||
/* Store the local value back to b11. */ \
|
||||
PASTEMAC(ch,copys)( beta11c, b[i*rs_b + j*cs_b] ); \
|
||||
} \
|
||||
} \
|
||||
}
|
||||
|
||||
//INSERT_GENTFUNC_BASIC2( trsm_l, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX )
|
||||
GENTFUNC( float, s, trsm_l, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX, 4, 16 )
|
||||
GENTFUNC( double, d, trsm_l, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX, 4, 8 )
|
||||
GENTFUNC( scomplex, c, trsm_l, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX, 4, 8 )
|
||||
GENTFUNC( dcomplex, z, trsm_l, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX, 4, 4 )
|
||||
|
||||
|
||||
#undef GENTFUNC
|
||||
#define GENTFUNC( ctype, ch, opname, arch, suf, mr, nr ) \
|
||||
\
|
||||
void PASTEMAC3(ch,opname,arch,suf) \
|
||||
( \
|
||||
ctype* restrict a, \
|
||||
ctype* restrict b, \
|
||||
ctype* restrict c, inc_t rs_c, inc_t cs_c, \
|
||||
auxinfo_t* restrict data, \
|
||||
cntx_t* restrict cntx \
|
||||
) \
|
||||
{ \
|
||||
const inc_t rs_a = 1; \
|
||||
const inc_t cs_a = mr; \
|
||||
\
|
||||
const inc_t rs_b = nr; \
|
||||
const inc_t cs_b = 1; \
|
||||
\
|
||||
PRAGMA_SIMD \
|
||||
for ( dim_t iter = 0; iter < mr; ++iter ) \
|
||||
{ \
|
||||
dim_t i = mr - iter - 1; \
|
||||
\
|
||||
/* b1 = b1 - a12t * B2; */ \
|
||||
/* b1 = b1 / alpha11; */ \
|
||||
for ( dim_t j = 0; j < nr; ++j ) \
|
||||
{ \
|
||||
ctype beta11c = b[i*rs_b + j*cs_b]; \
|
||||
ctype rho11; \
|
||||
\
|
||||
/* beta11 = beta11 - a12t * b21; */ \
|
||||
PASTEMAC(ch,set0s)( rho11 ); \
|
||||
for ( dim_t l = 0; l < iter; ++l ) \
|
||||
{ \
|
||||
PASTEMAC(ch,axpys)( a[i*rs_a + (i+1+l)*cs_a], \
|
||||
b[(i+1+l)*rs_b + j*cs_b], rho11 ); \
|
||||
} \
|
||||
PASTEMAC(ch,subs)( rho11, beta11c ); \
|
||||
\
|
||||
/* beta11 = beta11 / alpha11; */ \
|
||||
/* NOTE: The INVERSE of alpha11 (1.0/alpha11) is stored instead
|
||||
of alpha11, so we can multiply rather than divide. We store
|
||||
the inverse of alpha11 intentionally to avoid expensive
|
||||
division instructions within the micro-kernel. */ \
|
||||
PASTEMAC(ch,scals)( a[i*rs_a + i*cs_a], beta11c ); \
|
||||
\
|
||||
/* Output final result to matrix c. */ \
|
||||
PASTEMAC(ch,copys)( beta11c, c[i*rs_c + j*cs_c] ); \
|
||||
\
|
||||
/* Store the local value back to b11. */ \
|
||||
PASTEMAC(ch,copys)( beta11c, b[i*rs_b + j*cs_b] ); \
|
||||
} \
|
||||
} \
|
||||
}
|
||||
|
||||
//INSERT_GENTFUNC_BASIC2( trsm_u, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX )
|
||||
GENTFUNC( float, s, trsm_u, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX, 4, 16 )
|
||||
GENTFUNC( double, d, trsm_u, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX, 4, 8 )
|
||||
GENTFUNC( scomplex, c, trsm_u, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX, 4, 8 )
|
||||
GENTFUNC( dcomplex, z, trsm_u, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX, 4, 4 )
|
||||
// (Deleted. See 'old' directory.)
|
||||
|
||||
#else
|
||||
|
||||
@@ -166,7 +47,7 @@ GENTFUNC( dcomplex, z, trsm_u, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX, 4, 4 )
|
||||
// and makes no use of #pragma omp simd.
|
||||
|
||||
#undef GENTFUNC
|
||||
#define GENTFUNC( ctype, ch, opname, arch, suf ) \
|
||||
#define GENTFUNC( ctype, ch, opname, arch, suf, diagop ) \
|
||||
\
|
||||
void PASTEMAC3(ch,opname,arch,suf) \
|
||||
( \
|
||||
@@ -229,11 +110,11 @@ void PASTEMAC3(ch,opname,arch,suf) \
|
||||
PASTEMAC(ch,subs)( rho11, beta11c ); \
|
||||
\
|
||||
/* beta11 = beta11 / alpha11; */ \
|
||||
/* NOTE: The INVERSE of alpha11 (1.0/alpha11) is stored instead
|
||||
of alpha11, so we can multiply rather than divide. We store
|
||||
the inverse of alpha11 intentionally to avoid expensive
|
||||
division instructions within the micro-kernel. */ \
|
||||
PASTEMAC(ch,scals)( *alpha11, beta11c ); \
|
||||
/* NOTE: When preinversion is enabled, the INVERSE of alpha11
|
||||
(1.0/alpha11) is stored during packing instead alpha11 so we
|
||||
can multiply rather than divide. When preinversion is disabled,
|
||||
alpha11 is stored and division happens below explicitly. */ \
|
||||
PASTEMAC(ch,diagop)( *alpha11, beta11c ); \
|
||||
\
|
||||
/* Output final result to matrix c. */ \
|
||||
PASTEMAC(ch,copys)( beta11c, *gamma11 ); \
|
||||
@@ -244,11 +125,15 @@ void PASTEMAC3(ch,opname,arch,suf) \
|
||||
} \
|
||||
}
|
||||
|
||||
INSERT_GENTFUNC_BASIC2( trsm_l, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX )
|
||||
#ifdef BLIS_ENABLE_TRSM_PREINVERSION
|
||||
INSERT_GENTFUNC_BASIC3( trsm_l, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX, scals )
|
||||
#else
|
||||
INSERT_GENTFUNC_BASIC3( trsm_l, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX, invscals )
|
||||
#endif
|
||||
|
||||
|
||||
#undef GENTFUNC
|
||||
#define GENTFUNC( ctype, ch, opname, arch, suf ) \
|
||||
#define GENTFUNC( ctype, ch, opname, arch, suf, diagop ) \
|
||||
\
|
||||
void PASTEMAC3(ch,opname,arch,suf) \
|
||||
( \
|
||||
@@ -311,11 +196,11 @@ void PASTEMAC3(ch,opname,arch,suf) \
|
||||
PASTEMAC(ch,subs)( rho11, beta11c ); \
|
||||
\
|
||||
/* beta11 = beta11 / alpha11; */ \
|
||||
/* NOTE: The INVERSE of alpha11 (1.0/alpha11) is stored instead
|
||||
of alpha11, so we can multiply rather than divide. We store
|
||||
the inverse of alpha11 intentionally to avoid expensive
|
||||
division instructions within the micro-kernel. */ \
|
||||
PASTEMAC(ch,scals)( *alpha11, beta11c ); \
|
||||
/* NOTE: When preinversion is enabled, the INVERSE of alpha11
|
||||
(1.0/alpha11) is stored during packing instead alpha11 so we
|
||||
can multiply rather than divide. When preinversion is disabled,
|
||||
alpha11 is stored and division happens below explicitly. */ \
|
||||
PASTEMAC(ch,diagop)( *alpha11, beta11c ); \
|
||||
\
|
||||
/* Output final result to matrix c. */ \
|
||||
PASTEMAC(ch,copys)( beta11c, *gamma11 ); \
|
||||
@@ -326,6 +211,10 @@ void PASTEMAC3(ch,opname,arch,suf) \
|
||||
} \
|
||||
}
|
||||
|
||||
INSERT_GENTFUNC_BASIC2( trsm_u, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX )
|
||||
#ifdef BLIS_ENABLE_TRSM_PREINVERSION
|
||||
INSERT_GENTFUNC_BASIC3( trsm_u, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX, scals )
|
||||
#else
|
||||
INSERT_GENTFUNC_BASIC3( trsm_u, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX, invscals )
|
||||
#endif
|
||||
|
||||
#endif
|
||||
|
||||
165
ref_kernels/3/old/bli_trsm_simd_ref.c
Normal file
165
ref_kernels/3/old/bli_trsm_simd_ref.c
Normal file
@@ -0,0 +1,165 @@
|
||||
/*
|
||||
|
||||
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) \
|
||||
( \
|
||||
ctype* restrict a, \
|
||||
ctype* restrict b, \
|
||||
ctype* restrict c, inc_t rs_c, inc_t cs_c, \
|
||||
auxinfo_t* restrict data, \
|
||||
cntx_t* restrict cntx \
|
||||
) \
|
||||
{ \
|
||||
const inc_t rs_a = 1; \
|
||||
const inc_t cs_a = mr; \
|
||||
\
|
||||
const inc_t rs_b = nr; \
|
||||
const inc_t cs_b = 1; \
|
||||
\
|
||||
PRAGMA_SIMD \
|
||||
for ( dim_t i = 0; i < mr; ++i ) \
|
||||
{ \
|
||||
/* b1 = b1 - a10t * B0; */ \
|
||||
/* b1 = b1 / alpha11; */ \
|
||||
for ( dim_t j = 0; j < nr; ++j ) \
|
||||
{ \
|
||||
ctype beta11c = b[i*rs_b + j*cs_b]; \
|
||||
ctype rho11; \
|
||||
\
|
||||
/* beta11 = beta11 - a10t * b01; */ \
|
||||
PASTEMAC(ch,set0s)( rho11 ); \
|
||||
for ( dim_t l = 0; l < i; ++l ) \
|
||||
{ \
|
||||
PASTEMAC(ch,axpys)( a[i*rs_a + l*cs_a], \
|
||||
b[l*rs_b + j*cs_b], rho11 ); \
|
||||
} \
|
||||
PASTEMAC(ch,subs)( rho11, beta11c ); \
|
||||
\
|
||||
/* beta11 = beta11 / alpha11; */ \
|
||||
/* NOTE: The INVERSE of alpha11 (1.0/alpha11) is stored instead
|
||||
of alpha11, so we can multiply rather than divide. We store
|
||||
the inverse of alpha11 intentionally to avoid expensive
|
||||
division instructions within the micro-kernel. */ \
|
||||
PASTEMAC(ch,scals)( a[i*rs_a + i*cs_a], beta11c ); \
|
||||
\
|
||||
/* Output final result to matrix c. */ \
|
||||
PASTEMAC(ch,copys)( beta11c, c[i*rs_c + j*cs_c] ); \
|
||||
\
|
||||
/* Store the local value back to b11. */ \
|
||||
PASTEMAC(ch,copys)( beta11c, b[i*rs_b + j*cs_b] ); \
|
||||
} \
|
||||
} \
|
||||
}
|
||||
|
||||
//INSERT_GENTFUNC_BASIC2( trsm_l, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX )
|
||||
GENTFUNC( float, s, trsm_l, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX, 4, 16 )
|
||||
GENTFUNC( double, d, trsm_l, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX, 4, 8 )
|
||||
GENTFUNC( scomplex, c, trsm_l, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX, 4, 8 )
|
||||
GENTFUNC( dcomplex, z, trsm_l, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX, 4, 4 )
|
||||
|
||||
|
||||
#undef GENTFUNC
|
||||
#define GENTFUNC( ctype, ch, opname, arch, suf, mr, nr ) \
|
||||
\
|
||||
void PASTEMAC3(ch,opname,arch,suf) \
|
||||
( \
|
||||
ctype* restrict a, \
|
||||
ctype* restrict b, \
|
||||
ctype* restrict c, inc_t rs_c, inc_t cs_c, \
|
||||
auxinfo_t* restrict data, \
|
||||
cntx_t* restrict cntx \
|
||||
) \
|
||||
{ \
|
||||
const inc_t rs_a = 1; \
|
||||
const inc_t cs_a = mr; \
|
||||
\
|
||||
const inc_t rs_b = nr; \
|
||||
const inc_t cs_b = 1; \
|
||||
\
|
||||
PRAGMA_SIMD \
|
||||
for ( dim_t iter = 0; iter < mr; ++iter ) \
|
||||
{ \
|
||||
dim_t i = mr - iter - 1; \
|
||||
\
|
||||
/* b1 = b1 - a12t * B2; */ \
|
||||
/* b1 = b1 / alpha11; */ \
|
||||
for ( dim_t j = 0; j < nr; ++j ) \
|
||||
{ \
|
||||
ctype beta11c = b[i*rs_b + j*cs_b]; \
|
||||
ctype rho11; \
|
||||
\
|
||||
/* beta11 = beta11 - a12t * b21; */ \
|
||||
PASTEMAC(ch,set0s)( rho11 ); \
|
||||
for ( dim_t l = 0; l < iter; ++l ) \
|
||||
{ \
|
||||
PASTEMAC(ch,axpys)( a[i*rs_a + (i+1+l)*cs_a], \
|
||||
b[(i+1+l)*rs_b + j*cs_b], rho11 ); \
|
||||
} \
|
||||
PASTEMAC(ch,subs)( rho11, beta11c ); \
|
||||
\
|
||||
/* beta11 = beta11 / alpha11; */ \
|
||||
/* NOTE: The INVERSE of alpha11 (1.0/alpha11) is stored instead
|
||||
of alpha11, so we can multiply rather than divide. We store
|
||||
the inverse of alpha11 intentionally to avoid expensive
|
||||
division instructions within the micro-kernel. */ \
|
||||
PASTEMAC(ch,scals)( a[i*rs_a + i*cs_a], beta11c ); \
|
||||
\
|
||||
/* Output final result to matrix c. */ \
|
||||
PASTEMAC(ch,copys)( beta11c, c[i*rs_c + j*cs_c] ); \
|
||||
\
|
||||
/* Store the local value back to b11. */ \
|
||||
PASTEMAC(ch,copys)( beta11c, b[i*rs_b + j*cs_b] ); \
|
||||
} \
|
||||
} \
|
||||
}
|
||||
|
||||
//INSERT_GENTFUNC_BASIC2( trsm_u, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX )
|
||||
GENTFUNC( float, s, trsm_u, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX, 4, 16 )
|
||||
GENTFUNC( double, d, trsm_u, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX, 4, 8 )
|
||||
GENTFUNC( scomplex, c, trsm_u, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX, 4, 8 )
|
||||
GENTFUNC( dcomplex, z, trsm_u, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX, 4, 4 )
|
||||
|
||||
#else
|
||||
|
||||
#endif
|
||||
Reference in New Issue
Block a user