mirror of
https://github.com/amd/blis.git
synced 2026-04-30 20:41:13 +00:00
4b36e85be9
Details: - Converted most C preprocessor macros in bli_param_macro_defs.h and bli_obj_macro_defs.h to static functions. - Reshuffled some functions/macros to bli_misc_macro_defs.h and also between bli_param_macro_defs.h and bli_obj_macro_defs.h. - Changed obj_t-initializing macros in bli_type_defs.h to static functions. - Removed some old references to BLIS_TWO and BLIS_MINUS_TWO from bli_constants.h. - Whitespace changes in select files (four spaces to single tab).
201 lines
6.6 KiB
C
201 lines
6.6 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 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"
|
|
|
|
extern her2_t* her2_cntl_bs_ke_lrow_ucol;
|
|
extern her2_t* her2_cntl_bs_ke_lcol_urow;
|
|
extern her2_t* her2_cntl_ge_lrow_ucol;
|
|
extern her2_t* her2_cntl_ge_lcol_urow;
|
|
|
|
void bli_her2_front
|
|
(
|
|
obj_t* alpha,
|
|
obj_t* x,
|
|
obj_t* y,
|
|
obj_t* c,
|
|
cntx_t* cntx
|
|
)
|
|
{
|
|
her2_t* her2_cntl;
|
|
num_t dt_targ_x;
|
|
num_t dt_targ_y;
|
|
//num_t dt_targ_c;
|
|
bool_t x_has_unit_inc;
|
|
bool_t y_has_unit_inc;
|
|
bool_t c_has_unit_inc;
|
|
obj_t alpha_local;
|
|
obj_t alpha_conj_local;
|
|
num_t dt_alpha;
|
|
|
|
// Check parameters.
|
|
if ( bli_error_checking_is_enabled() )
|
|
bli_her2_check( alpha, x, y, c );
|
|
|
|
|
|
// Query the target datatypes of each object.
|
|
dt_targ_x = bli_obj_target_dt( x );
|
|
dt_targ_y = bli_obj_target_dt( y );
|
|
//dt_targ_c = bli_obj_target_dt( c );
|
|
|
|
// Determine whether each operand with unit stride.
|
|
x_has_unit_inc = ( bli_obj_vector_inc( x ) == 1 );
|
|
y_has_unit_inc = ( bli_obj_vector_inc( y ) == 1 );
|
|
c_has_unit_inc = ( bli_obj_is_row_stored( c ) ||
|
|
bli_obj_is_col_stored( c ) );
|
|
|
|
|
|
// Create an object to hold a copy-cast of alpha. Notice that we use
|
|
// the type union of the datatypes of x and y.
|
|
dt_alpha = bli_dt_union( dt_targ_x, dt_targ_y );
|
|
bli_obj_scalar_init_detached_copy_of( dt_alpha,
|
|
BLIS_NO_CONJUGATE,
|
|
alpha,
|
|
&alpha_local );
|
|
|
|
// Also create a conjugated copy of alpha.
|
|
bli_obj_scalar_init_detached_copy_of( dt_alpha,
|
|
BLIS_CONJUGATE,
|
|
alpha,
|
|
&alpha_conj_local );
|
|
|
|
|
|
// If all operands have unit stride, we choose a control tree for calling
|
|
// the unblocked implementation directly without any blocking.
|
|
if ( x_has_unit_inc &&
|
|
y_has_unit_inc &&
|
|
c_has_unit_inc )
|
|
{
|
|
// We use two control trees to handle the four cases corresponding to
|
|
// combinations of upper/lower triangular storage and row/column-storage.
|
|
// The row-stored lower triangular and column-stored upper triangular
|
|
// trees are identical. Same for the remaining two trees.
|
|
if ( bli_obj_is_lower( c ) )
|
|
{
|
|
if ( bli_obj_is_row_stored( c ) ) her2_cntl = her2_cntl_bs_ke_lrow_ucol;
|
|
else her2_cntl = her2_cntl_bs_ke_lcol_urow;
|
|
}
|
|
else // if ( bli_obj_is_upper( c ) )
|
|
{
|
|
if ( bli_obj_is_row_stored( c ) ) her2_cntl = her2_cntl_bs_ke_lcol_urow;
|
|
else her2_cntl = her2_cntl_bs_ke_lrow_ucol;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
// Mark objects with unit stride as already being packed. This prevents
|
|
// unnecessary packing from happening within the blocked algorithm.
|
|
if ( x_has_unit_inc ) bli_obj_set_pack_schema( BLIS_PACKED_VECTOR, x );
|
|
if ( y_has_unit_inc ) bli_obj_set_pack_schema( BLIS_PACKED_VECTOR, y );
|
|
if ( c_has_unit_inc ) bli_obj_set_pack_schema( BLIS_PACKED_UNSPEC, c );
|
|
|
|
// Here, we make a similar choice as above, except that (1) we look
|
|
// at storage tilt, and (2) we choose a tree that performs blocking.
|
|
if ( bli_obj_is_lower( c ) )
|
|
{
|
|
if ( bli_obj_is_row_stored( c ) ) her2_cntl = her2_cntl_ge_lrow_ucol;
|
|
else her2_cntl = her2_cntl_ge_lcol_urow;
|
|
}
|
|
else // if ( bli_obj_is_upper( c ) )
|
|
{
|
|
if ( bli_obj_is_row_stored( c ) ) her2_cntl = her2_cntl_ge_lcol_urow;
|
|
else her2_cntl = her2_cntl_ge_lrow_ucol;
|
|
}
|
|
}
|
|
|
|
// Invoke the internal back-end with the copy-cast scalar and the
|
|
// chosen control tree. Set conjh to BLIS_CONJUGATE to invoke the
|
|
// Hermitian (and not symmetric) algorithms.
|
|
bli_her2_int( BLIS_CONJUGATE,
|
|
&alpha_local,
|
|
&alpha_conj_local,
|
|
x,
|
|
y,
|
|
c,
|
|
cntx,
|
|
her2_cntl );
|
|
}
|
|
|
|
|
|
//
|
|
// Define BLAS-like interfaces with homogeneous-typed operands.
|
|
//
|
|
#undef GENTFUNC
|
|
#define GENTFUNC( ctype, ch, opname ) \
|
|
\
|
|
void PASTEMAC(ch,opname) \
|
|
( \
|
|
uplo_t uploc, \
|
|
conj_t conjx, \
|
|
conj_t conjy, \
|
|
dim_t m, \
|
|
ctype* alpha, \
|
|
ctype* x, inc_t incx, \
|
|
ctype* y, inc_t incy, \
|
|
ctype* c, inc_t rs_c, inc_t cs_c, \
|
|
cntx_t* cntx \
|
|
) \
|
|
{ \
|
|
const num_t dt = PASTEMAC(ch,type); \
|
|
\
|
|
obj_t alphao, xo, yo, co; \
|
|
\
|
|
inc_t rs_x, cs_x; \
|
|
inc_t rs_y, cs_y; \
|
|
\
|
|
rs_x = incx; cs_x = m * incx; \
|
|
rs_y = incy; cs_y = m * incy; \
|
|
\
|
|
bli_obj_create_1x1_with_attached_buffer( dt, alpha, &alphao ); \
|
|
\
|
|
bli_obj_create_with_attached_buffer( dt, m, 1, x, rs_x, cs_x, &xo ); \
|
|
bli_obj_create_with_attached_buffer( dt, m, 1, y, rs_y, cs_y, &yo ); \
|
|
bli_obj_create_with_attached_buffer( dt, m, m, c, rs_c, cs_c, &co ); \
|
|
\
|
|
bli_obj_set_conj( conjx, &xo ); \
|
|
bli_obj_set_conj( conjy, &yo ); \
|
|
bli_obj_set_uplo( uploc, &co ); \
|
|
\
|
|
bli_obj_set_struc( BLIS_HERMITIAN, &co ); \
|
|
\
|
|
PASTEMAC0(opname)( &alphao, \
|
|
&xo, \
|
|
&yo, \
|
|
&co, \
|
|
cntx ); \
|
|
}
|
|
|
|
INSERT_GENTFUNC_BASIC0( her2_front )
|
|
|