mirror of
https://github.com/amd/blis.git
synced 2026-05-01 04:51:11 +00:00
Details: - Defined two new functions in bli_init.c: bli_init_once() and bli_finalize_once(). Each is implemented with pthread_once(), which guarantees that, among the threads that pass in the same pthread_once_t data structure, exactly one thread will execute a user-defined function. (Thus, there is now a runtime dependency against libpthread even when multithreading is not enabled at configure-time.) - Added calls to bli_init_once() to top-level user APIs for all computational operations as well as many other functions in BLIS to all but guarantee that BLIS will self-initialize through the normal use of its functions. - Rewrote and simplified bli_init() and bli_finalize() and related functions. - Added -lpthread to LDFLAGS in common.mk. - Modified the bli_init_auto()/_finalize_auto() functions used by the BLAS compatibility layer to take and return no arguments. (The previous API that tracked whether BLIS was initialized, and then only finalized if it was initialized in the same function, was too cute by half and borderline useless because by default BLIS stays initialized when auto-initialized via the compatibility layer.) - Removed static variables that track initialization of the sub-APIs in bli_const.c, bli_error.c, bli_init.c, bli_memsys.c, bli_thread, and bli_ind.c. We don't need to track initialization at the sub-API level, especially now that BLIS can self-initialize. - Added a critical section around the changing of the error checking level in bli_error.c. - Deprecated bli_ind_oper_has_avail() as well as all functions bli_<opname>_ind_get_avail(), where <opname> is a level-3 operation name. These functions had no use cases within BLIS and likely none outside of BLIS. - Commented out calls to bli_init() and bli_finalize() in testsuite's main() function, and likewise for standalone test drivers in 'test' directory, so that self-initialization is exercised by default.
148 lines
4.8 KiB
C
148 lines
4.8 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"
|
|
|
|
void bli_trsm_front
|
|
(
|
|
side_t side,
|
|
obj_t* alpha,
|
|
obj_t* a,
|
|
obj_t* b,
|
|
cntx_t* cntx,
|
|
cntl_t* cntl
|
|
)
|
|
{
|
|
bli_init_once();
|
|
|
|
obj_t a_local;
|
|
obj_t b_local;
|
|
obj_t c_local;
|
|
|
|
// Check parameters.
|
|
if ( bli_error_checking_is_enabled() )
|
|
bli_trsm_check( side, alpha, a, b, &BLIS_ZERO, b, cntx );
|
|
|
|
// If alpha is zero, scale by beta and return.
|
|
if ( bli_obj_equals( alpha, &BLIS_ZERO ) )
|
|
{
|
|
bli_scalm( alpha, b );
|
|
return;
|
|
}
|
|
|
|
// Reinitialize the memory allocator to accommodate the blocksizes
|
|
// in the current context.
|
|
bli_memsys_reinit( cntx );
|
|
|
|
// Alias A and B so we can tweak the objects if necessary.
|
|
bli_obj_alias_to( *a, a_local );
|
|
bli_obj_alias_to( *b, b_local );
|
|
bli_obj_alias_to( *b, c_local );
|
|
|
|
// We do not explicitly implement the cases where A is transposed.
|
|
// However, we can still handle them. Specifically, if A is marked as
|
|
// needing a transposition, we simply induce a transposition. This
|
|
// allows us to only explicitly implement the no-transpose cases. Once
|
|
// the transposition is induced, the correct algorithm will be called,
|
|
// since, for example, an algorithm over a transposed lower triangular
|
|
// matrix A moves in the same direction (forwards) as a non-transposed
|
|
// upper triangular matrix. And with the transposition induced, the
|
|
// matrix now appears to be upper triangular, so the upper triangular
|
|
// algorithm will grab the correct partitions, as if it were upper
|
|
// triangular (with no transpose) all along.
|
|
if ( bli_obj_has_trans( a_local ) )
|
|
{
|
|
bli_obj_induce_trans( a_local );
|
|
bli_obj_set_onlytrans( BLIS_NO_TRANSPOSE, a_local );
|
|
}
|
|
|
|
#if 1
|
|
|
|
// If A is being solved against from the right, transpose all operands
|
|
// so that we can perform the computation as if A were being solved
|
|
// from the left.
|
|
if ( bli_is_right( side ) )
|
|
{
|
|
bli_toggle_side( side );
|
|
bli_obj_induce_trans( a_local );
|
|
bli_obj_induce_trans( b_local );
|
|
bli_obj_induce_trans( c_local );
|
|
}
|
|
|
|
#else
|
|
|
|
// NOTE: Enabling this code requires that BLIS NOT be configured with
|
|
// BLIS_RELAX_MCNR_NCMR_CONSTRAINTS defined.
|
|
#ifdef BLIS_RELAX_MCNR_NCMR_CONSTRAINTS
|
|
#error "BLIS_RELAX_MCNR_NCMR_CONSTRAINTS must not be defined for current trsm_r implementation."
|
|
#endif
|
|
|
|
// If A is being solved against from the right, swap A and B so that
|
|
// the triangular matrix will actually be on the right.
|
|
if ( bli_is_right( side ) )
|
|
{
|
|
bli_obj_swap( a_local, b_local );
|
|
}
|
|
|
|
#endif
|
|
|
|
// Set each alias as the root object.
|
|
// NOTE: We MUST wait until we are done potentially swapping the objects
|
|
// before setting the root fields!
|
|
bli_obj_set_as_root( a_local );
|
|
bli_obj_set_as_root( b_local );
|
|
bli_obj_set_as_root( c_local );
|
|
|
|
// Record the threading for each level within the context.
|
|
bli_cntx_set_thrloop_from_env( BLIS_TRSM, side, cntx,
|
|
bli_obj_length( c_local ),
|
|
bli_obj_width( c_local ),
|
|
bli_obj_width( a_local ) );
|
|
|
|
// Invoke the internal back-end.
|
|
bli_l3_thread_decorator
|
|
(
|
|
bli_trsm_int,
|
|
BLIS_TRSM, // operation family id
|
|
alpha,
|
|
&a_local,
|
|
&b_local,
|
|
alpha,
|
|
&c_local,
|
|
cntx,
|
|
cntl
|
|
);
|
|
}
|
|
|