amd/blis
1
0
Fork 0
mirror of https://github.com/amd/blis.git synced 2026-05-11 01:30:00 +00:00
Code Issues Packages Projects Releases Wiki Activity
Files
7ed415824d3b2e78541b6f64e404ca5347c06d3d
blis/frame/2/trmv/bli_trmv_unf_var1.c
Field G. Van Zee 7ed415824d Updated copyright headers (continued). 
Details:
- Inserted "at Austin" into third clause of license declarations.
  Meant to include this change in previous commit.
2014-07-14 16:14:33 -05:00

291 lines
9.4 KiB
C
Raw Blame History

/*
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 "blis.h"
#define FUNCPTR_T trmv_fp
typedef void (*FUNCPTR_T)(
uplo_t uplo,
trans_t trans,
diag_t diag,
dim_t m,
void* alpha,
void* a, inc_t rs_a, inc_t cs_a,
void* x, inc_t incx
);
// If some mixed datatype functions will not be compiled, we initialize
// the corresponding elements of the function array to NULL.
#ifdef BLIS_ENABLE_MIXED_PRECISION_SUPPORT
static FUNCPTR_T GENARRAY2_ALL(ftypes,trmv_unf_var1);
#else
#ifdef BLIS_ENABLE_MIXED_DOMAIN_SUPPORT
static FUNCPTR_T GENARRAY2_EXT(ftypes,trmv_unf_var1);
#else
static FUNCPTR_T GENARRAY2_MIN(ftypes,trmv_unf_var1);
#endif
#endif
void bli_trmv_unf_var1( obj_t* alpha,
obj_t* a,
obj_t* x,
trmv_t* cntl )
{
num_t dt_a = bli_obj_datatype( *a );
num_t dt_x = bli_obj_datatype( *x );
uplo_t uplo = bli_obj_uplo( *a );
trans_t trans = bli_obj_conjtrans_status( *a );
diag_t diag = bli_obj_diag( *a );
dim_t m = bli_obj_length( *a );
void* buf_a = bli_obj_buffer_at_off( *a );
inc_t rs_a = bli_obj_row_stride( *a );
inc_t cs_a = bli_obj_col_stride( *a );
void* buf_x = bli_obj_buffer_at_off( *x );
inc_t incx = bli_obj_vector_inc( *x );
num_t dt_alpha;
void* buf_alpha;
FUNCPTR_T f;
// The datatype of alpha MUST be the type union of a and x. This is to
// prevent any unnecessary loss of information during computation.
dt_alpha = bli_datatype_union( dt_a, dt_x );
buf_alpha = bli_obj_buffer_for_1x1( dt_alpha, *alpha );
// Index into the type combination array to extract the correct
// function pointer.
f = ftypes[dt_a][dt_x];
// Invoke the function.
f( uplo,
trans,
diag,
m,
buf_alpha,
buf_a, rs_a, cs_a,
buf_x, incx );
}
#undef GENTFUNC2U
#define GENTFUNC2U( ctype_a, ctype_x, ctype_ax, cha, chx, chax, varname, kername ) \
\
void PASTEMAC2(cha,chx,varname)( \
uplo_t uplo, \
trans_t trans, \
diag_t diag, \
dim_t m, \
void* alpha, \
void* a, inc_t rs_a, inc_t cs_a, \
void* x, inc_t incx \
) \
{ \
ctype_ax* alpha_cast = alpha; \
ctype_a* a_cast = a; \
ctype_x* x_cast = x; \
ctype_x* one = PASTEMAC(chx,1); \
ctype_a* A10; \
ctype_a* A11; \
ctype_a* A12; \
ctype_a* a10t; \
ctype_a* alpha11; \
ctype_a* a12t; \
ctype_x* x0; \
ctype_x* x1; \
ctype_x* x2; \
ctype_x* x01; \
ctype_x* chi11; \
ctype_x* x21; \
ctype_ax alpha_alpha11_conj; \
ctype_ax rho1; \
dim_t iter, i, k, j, l; \
dim_t b_fuse, f; \
dim_t n_ahead, f_ahead; \
inc_t rs_at, cs_at; \
uplo_t uplo_trans; \
conj_t conja; \
\
if ( bli_zero_dim1( m ) ) return; \
\
if ( bli_does_notrans( trans ) ) \
{ \
rs_at = rs_a; \
cs_at = cs_a; \
uplo_trans = uplo; \
} \
else /* if ( bli_does_trans( trans ) ) */ \
{ \
rs_at = cs_a; \
cs_at = rs_a; \
uplo_trans = bli_uplo_toggled( uplo ); \
} \
\
conja = bli_extract_conj( trans ); \
\
/* Query the fusing factor for the dotxf implementation. */ \
b_fuse = PASTEMAC(chax,dotxf_fusefac); \
\
/* We reduce all of the possible cases down to just lower/upper. */ \
if ( bli_is_upper( uplo_trans ) ) \
{ \
for ( iter = 0; iter < m; iter += f ) \
{ \
f = bli_determine_blocksize_dim_f( iter, m, b_fuse ); \
i = iter; \
n_ahead = m - iter - f; \
A11 = a_cast + (i )*rs_at + (i )*cs_at; \
A12 = a_cast + (i )*rs_at + (i+f)*cs_at; \
x1 = x_cast + (i )*incx; \
x2 = x_cast + (i+f)*incx; \
\
/* x1 = alpha * A11 * x1; */ \
for ( k = 0; k < f; ++k ) \
{ \
l = k; \
f_ahead = f - l - 1; \
alpha11 = A11 + (l )*rs_at + (l )*cs_at; \
a12t = A11 + (l )*rs_at + (l+1)*cs_at; \
chi11 = x1 + (l )*incx; \
x21 = x1 + (l+1)*incx; \
\
/* chi11 = alpha * alpha11 * chi11; */ \
PASTEMAC2(chax,chax,copys)( *alpha_cast, alpha_alpha11_conj ); \
if ( bli_is_nonunit_diag( diag ) ) \
PASTEMAC2(cha,chax,scalcjs)( conja, *alpha11, alpha_alpha11_conj ); \
PASTEMAC2(chax,chx,scals)( alpha_alpha11_conj, *chi11 ); \
\
/* chi11 = chi11 + alpha * a12t * x21; */ \
PASTEMAC(chax,set0s)( rho1 ); \
if ( bli_is_conj( conja ) ) \
{ \
for ( j = 0; j < f_ahead; ++j ) \
PASTEMAC3(cha,chx,chax,dotjs)( *(a12t + j*cs_at), *(x21 + j*incx), rho1 ); \
} \
else \
{ \
for ( j = 0; j < f_ahead; ++j ) \
PASTEMAC3(cha,chx,chax,dots)( *(a12t + j*cs_at), *(x21 + j*incx), rho1 ); \
} \
PASTEMAC3(chax,chax,chx,axpys)( *alpha_cast, rho1, *chi11 ); \
} \
\
/* x1 = x1 + alpha * A12 * x2; */ \
PASTEMAC3(cha,chx,chx,kername)( conja, \
BLIS_NO_CONJUGATE, \
n_ahead, \
f, \
alpha_cast, \
A12, cs_at, rs_at, \
x2, incx, \
one, \
x1, incx ); \
} \
} \
else /* if ( bli_is_lower( uplo_trans ) ) */ \
{ \
for ( iter = 0; iter < m; iter += f ) \
{ \
f = bli_determine_blocksize_dim_b( iter, m, b_fuse ); \
i = m - iter - f; \
n_ahead = i; \
A11 = a_cast + (i )*rs_at + (i )*cs_at; \
A10 = a_cast + (i )*rs_at + (0 )*cs_at; \
x1 = x_cast + (i )*incx; \
x0 = x_cast + (0 )*incx; \
\
/* x1 = alpha * A11 * x1; */ \
for ( k = 0; k < f; ++k ) \
{ \
l = f - k - 1; \
f_ahead = l; \
alpha11 = A11 + (l )*rs_at + (l )*cs_at; \
a10t = A11 + (l )*rs_at + (0 )*cs_at; \
chi11 = x1 + (l )*incx; \
x01 = x1 + (0 )*incx; \
\
/* chi11 = alpha * alpha11 * chi11; */ \
PASTEMAC2(chax,chax,copys)( *alpha_cast, alpha_alpha11_conj ); \
if ( bli_is_nonunit_diag( diag ) ) \
PASTEMAC2(cha,chax,scalcjs)( conja, *alpha11, alpha_alpha11_conj ); \
PASTEMAC2(chax,chx,scals)( alpha_alpha11_conj, *chi11 ); \
\
/* chi11 = chi11 + alpha * a10t * x01; */ \
PASTEMAC(chax,set0s)( rho1 ); \
if ( bli_is_conj( conja ) ) \
{ \
for ( j = 0; j < f_ahead; ++j ) \
PASTEMAC3(cha,chx,chax,dotjs)( *(a10t + j*cs_at), *(x01 + j*incx), rho1 ); \
} \
else \
{ \
for ( j = 0; j < f_ahead; ++j ) \
PASTEMAC3(cha,chx,chax,dots)( *(a10t + j*cs_at), *(x01 + j*incx), rho1 ); \
} \
PASTEMAC3(chax,chax,chx,axpys)( *alpha_cast, rho1, *chi11 ); \
} \
\
/* x1 = x1 + alpha * A10 * x0; */ \
PASTEMAC3(cha,chx,chx,kername)( conja, \
BLIS_NO_CONJUGATE, \
n_ahead, \
f, \
alpha_cast, \
A10, cs_at, rs_at, \
x0, incx, \
one, \
x1, incx ); \
} \
} \
}
// Define the basic set of functions unconditionally, and then also some
// mixed datatype functions if requested.
INSERT_GENTFUNC2U_BASIC( trmv_unf_var1, DOTXF_KERNEL )
#ifdef BLIS_ENABLE_MIXED_DOMAIN_SUPPORT
INSERT_GENTFUNC2U_MIX_D( trmv_unf_var1, DOTXF_KERNEL )
#endif
#ifdef BLIS_ENABLE_MIXED_PRECISION_SUPPORT
INSERT_GENTFUNC2U_MIX_P( trmv_unf_var1, DOTXF_KERNEL )
#endif
Reference in New Issue View Git Blame Copy Permalink