mirror of
https://github.com/amd/blis.git
synced 2026-05-11 09:39:59 +00:00
Details: - Defined a new struct datatype, rntm_t (runtime), to house the thrloop field of the cntx_t (context). The thrloop array holds the number of ways of parallelism (thread "splits") to extract per level-3 algorithmic loop until those values can be used to create a corresponding node in the thread control tree (thrinfo_t structure), which (for any given level-3 invocation) usually happens by the time the macrokernel is called for the first time. - Relocating the thrloop from the cntx_t remedies a thread-safety issue when invoking level-3 operations from two or more application threads. The race condition existed because the cntx_t, a pointer to which is usually queried from the global kernel structure (gks), is supposed to be a read-only. However, the previous code would write to the cntx_t's thrloop field *after* it had been queried, thus violating its read-only status. In practice, this would not cause a problem when a sequential application made a multithreaded call to BLIS, nor when two or more application threads used the same parallelization scheme when calling BLIS, because in either case all application theads would be using the same ways of parallelism for each loop. The true effects of the race condition were limited to situations where two or more application theads used *different* parallelization schemes for any given level-3 call. - In remedying the above race condition, the application or calling library can now specify the parallelization scheme on a per-call basis. All that is required is that the thread encode its request for parallelism into the rntm_t struct prior to passing the address of the rntm_t to one of the expert interfaces of either the typed or object APIs. This allows, for example, one application thread to extract 4-way parallelism from a call to gemm while another application thread requests 2-way parallelism. Or, two threads could each request 4-way parallelism, but from different loops. - A rntm_t* parameter has been added to the function signatures of most of the level-3 implementation stack (with the most notable exception being packm) as well as all level-1v, -1d, -1f, -1m, and -2 expert APIs. (A few internal functions gained the rntm_t* parameter even though they currently have no use for it, such as bli_l3_packm().) This required some internal calls to some of those functions to be updated since BLIS was already using those operations internally via the expert interfaces. For situations where a rntm_t object is not available, such as within packm/unpackm implementations, NULL is passed in to the relevant expert interfaces. This is acceptable for now since parallelism is not obtained for non-level-3 operations. - Revamped how global parallelism is encoded. First, the conventional environment variables such as BLIS_NUM_THREADS and BLIS_*_NT are only read once, at library initialization. (Thanks to Nathaniel Smith for suggesting this to avoid repeated calls getenv(), which can be slow.) Those values are recorded to a global rntm_t object. Public APIs, in bli_thread.c, are still available to get/set these values from the global rntm_t, though now the "set" functions have additional logic to ensure that the values are set in a synchronous manner via a mutex. If/when NULL is passed into an expert API (meaning the user opted to not provide a custom rntm_t), the values from the global rntm_t are copied to a local rntm_t, which is then passed down the function stack. Calling a basic API is equivalent to calling the expert APIs with NULL for the cntx and rntm parameters, which means the semantic behavior of these basic APIs (vis-a-vis multithreading) is unchanged from before. - Renamed bli_cntx_set_thrloop_from_env() to bli_rntm_set_ways_for_op() and reimplemented, with the function now being able to treat the incoming rntm_t in a manner agnostic to its origin--whether it came from the application or is an internal copy of the global rntm_t. - Removed various global runtime APIs for setting the number of ways of parallelism for individual loops (e.g. bli_thread_set_*_nt()) as well as the corresponding "get" functions. The new model simplifies these interfaces so that one must either set the total number of threads, OR set all of the ways of parallelism for each loop simultaneously (in a single function call). - Updated sandbox/ref99 according to above changes. - Rewrote/augmented docs/Multithreading.md to document the three methods (and two specific ways within each method) of requesting parallelism in BLIS. - Removed old, disabled code from bli_l3_thrinfo.c. - Whitespace changes to code (e.g. bli_obj.c) and docs/BuildSystem.md.
623 lines
18 KiB
C
623 lines
18 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_obj_create
|
|
(
|
|
num_t dt,
|
|
dim_t m,
|
|
dim_t n,
|
|
inc_t rs,
|
|
inc_t cs,
|
|
obj_t* obj
|
|
)
|
|
{
|
|
bli_init_once();
|
|
|
|
bli_obj_create_without_buffer( dt, m, n, obj );
|
|
|
|
bli_obj_alloc_buffer( rs, cs, 1, obj );
|
|
}
|
|
|
|
void bli_obj_create_with_attached_buffer
|
|
(
|
|
num_t dt,
|
|
dim_t m,
|
|
dim_t n,
|
|
void* p,
|
|
inc_t rs,
|
|
inc_t cs,
|
|
obj_t* obj
|
|
)
|
|
{
|
|
bli_init_once();
|
|
|
|
bli_obj_create_without_buffer( dt, m, n, obj );
|
|
|
|
bli_obj_attach_buffer( p, rs, cs, 1, obj );
|
|
}
|
|
|
|
void bli_obj_create_without_buffer
|
|
(
|
|
num_t dt,
|
|
dim_t m,
|
|
dim_t n,
|
|
obj_t* obj
|
|
)
|
|
{
|
|
siz_t elem_size;
|
|
void* s;
|
|
|
|
bli_init_once();
|
|
|
|
if ( bli_error_checking_is_enabled() )
|
|
bli_obj_create_without_buffer_check( dt, m, n, obj );
|
|
|
|
// Query the size of one element of the object's pre-set datatype.
|
|
elem_size = bli_dt_size( dt );
|
|
|
|
// Set any default properties that are appropriate.
|
|
bli_obj_set_defaults( obj );
|
|
|
|
// Set the object root to itself, since obj is not presumed to be a view
|
|
// into a larger matrix. This is typically the only time this field is
|
|
// ever set; henceforth, subpartitions and aliases to this object will
|
|
// get copies of this field, and thus always have access to its
|
|
// "greatest-grand" parent (ie: the original parent, or "root", object).
|
|
// However, there ARE a few places where it is convenient to reset the
|
|
// root field explicitly via bli_obj_set_as_root(). (We do not list
|
|
// those places here. Just grep for bli_obj_set_as_root within the
|
|
// top-level 'frame' directory to see them.
|
|
bli_obj_set_as_root( obj );
|
|
|
|
// Set individual fields.
|
|
bli_obj_set_buffer( NULL, obj );
|
|
bli_obj_set_dt( dt, obj );
|
|
bli_obj_set_elem_size( elem_size, obj );
|
|
bli_obj_set_target_dt( dt, obj );
|
|
bli_obj_set_exec_dt( dt, obj );
|
|
bli_obj_set_dims( m, n, obj );
|
|
bli_obj_set_offs( 0, 0, obj );
|
|
bli_obj_set_diag_offset( 0, obj );
|
|
|
|
// Set the internal scalar to 1.0.
|
|
s = bli_obj_internal_scalar_buffer( obj );
|
|
|
|
if ( bli_is_float( dt ) ) { bli_sset1s( *(( float* )s) ); }
|
|
else if ( bli_is_double( dt ) ) { bli_dset1s( *(( double* )s) ); }
|
|
else if ( bli_is_scomplex( dt ) ) { bli_cset1s( *(( scomplex* )s) ); }
|
|
else if ( bli_is_dcomplex( dt ) ) { bli_zset1s( *(( dcomplex* )s) ); }
|
|
}
|
|
|
|
void bli_obj_alloc_buffer
|
|
(
|
|
inc_t rs,
|
|
inc_t cs,
|
|
inc_t is,
|
|
obj_t* obj
|
|
)
|
|
{
|
|
dim_t n_elem = 0;
|
|
dim_t m, n;
|
|
siz_t elem_size;
|
|
siz_t buffer_size;
|
|
void* p;
|
|
|
|
bli_init_once();
|
|
|
|
// Query the dimensions of the object we are allocating.
|
|
m = bli_obj_length( obj );
|
|
n = bli_obj_width( obj );
|
|
|
|
// Query the size of one element.
|
|
elem_size = bli_obj_elem_size( obj );
|
|
|
|
// Adjust the strides, if needed, before doing anything else
|
|
// (particularly, before doing any error checking).
|
|
bli_adjust_strides( m, n, elem_size, &rs, &cs, &is );
|
|
|
|
if ( bli_error_checking_is_enabled() )
|
|
bli_obj_alloc_buffer_check( rs, cs, is, obj );
|
|
|
|
// Determine how much object to allocate.
|
|
if ( m == 0 || n == 0 )
|
|
{
|
|
// For empty objects, set n_elem to zero. Row and column strides
|
|
// should remain unchanged (because alignment is not needed).
|
|
n_elem = 0;
|
|
}
|
|
else
|
|
{
|
|
// The number of elements to allocate is given by the distance from
|
|
// the element with the lowest address (usually {0, 0}) to the element
|
|
// with the highest address (usually {m-1, n-1}), plus one for the
|
|
// highest element itself.
|
|
n_elem = (m-1) * bli_abs( rs ) + (n-1) * bli_abs( cs ) + 1;
|
|
}
|
|
|
|
// Handle the special case where imaginary stride is larger than
|
|
// normal.
|
|
if ( bli_obj_is_complex( obj ) )
|
|
{
|
|
// Notice that adding is/2 works regardless of whether the
|
|
// imaginary stride is unit, something between unit and
|
|
// 2*n_elem, or something bigger than 2*n_elem.
|
|
n_elem = bli_abs( is ) / 2 + n_elem;
|
|
}
|
|
|
|
// Compute the size of the total buffer to be allocated, which includes
|
|
// padding if the leading dimension was increased for alignment purposes.
|
|
buffer_size = ( siz_t )n_elem * elem_size;
|
|
|
|
// Allocate the buffer.
|
|
p = bli_malloc_user( buffer_size );
|
|
|
|
// Set individual fields.
|
|
bli_obj_set_buffer( p, obj );
|
|
bli_obj_set_strides( rs, cs, obj );
|
|
bli_obj_set_imag_stride( is, obj );
|
|
}
|
|
|
|
void bli_obj_attach_buffer
|
|
(
|
|
void* p,
|
|
inc_t rs,
|
|
inc_t cs,
|
|
inc_t is,
|
|
obj_t* obj
|
|
)
|
|
{
|
|
bli_init_once();
|
|
|
|
// Interpret is = 0 as a request for the default, which is is = 1;
|
|
if ( is == 0 ) is = 1;
|
|
|
|
// Check that the strides and lengths are compatible. Note that the
|
|
// user *must* specify valid row and column strides when attaching an
|
|
// external buffer.
|
|
if ( bli_error_checking_is_enabled() )
|
|
bli_obj_attach_buffer_check( p, rs, cs, is, obj );
|
|
|
|
// Update the object.
|
|
bli_obj_set_buffer( p, obj );
|
|
bli_obj_set_strides( rs, cs, obj );
|
|
bli_obj_set_imag_stride( is, obj );
|
|
}
|
|
|
|
void bli_obj_create_1x1
|
|
(
|
|
num_t dt,
|
|
obj_t* obj
|
|
)
|
|
{
|
|
bli_obj_create_without_buffer( dt, 1, 1, obj );
|
|
|
|
bli_obj_alloc_buffer( 1, 1, 1, obj );
|
|
}
|
|
|
|
void bli_obj_create_1x1_with_attached_buffer
|
|
(
|
|
num_t dt,
|
|
void* p,
|
|
obj_t* obj
|
|
)
|
|
{
|
|
bli_obj_create_without_buffer( dt, 1, 1, obj );
|
|
|
|
bli_obj_attach_buffer( p, 1, 1, 1, obj );
|
|
}
|
|
|
|
void bli_obj_create_conf_to
|
|
(
|
|
obj_t* s,
|
|
obj_t* d
|
|
)
|
|
{
|
|
const num_t dt = bli_obj_dt( s );
|
|
const dim_t m = bli_obj_length( s );
|
|
const dim_t n = bli_obj_width( s );
|
|
const inc_t rs = bli_obj_row_stride( s );
|
|
const inc_t cs = bli_obj_col_stride( s );
|
|
|
|
bli_obj_create( dt, m, n, rs, cs, d );
|
|
}
|
|
|
|
void bli_obj_free
|
|
(
|
|
obj_t* obj
|
|
)
|
|
{
|
|
if ( bli_error_checking_is_enabled() )
|
|
bli_obj_free_check( obj );
|
|
|
|
// Don't dereference obj if it is NULL.
|
|
if ( obj != NULL )
|
|
{
|
|
// Idiot safety: Don't try to free the buffer field if the object
|
|
// is a detached scalar (ie: if the buffer pointer refers to the
|
|
// address of the internal scalar buffer).
|
|
if ( bli_obj_buffer( obj ) != bli_obj_internal_scalar_buffer( obj ) )
|
|
bli_free_user( bli_obj_buffer( obj ) );
|
|
}
|
|
}
|
|
|
|
#if 0
|
|
//void bli_obj_create_const
|
|
(
|
|
double value,
|
|
obj_t* obj
|
|
)
|
|
{
|
|
gint_t* temp_i;
|
|
float* temp_s;
|
|
double* temp_d;
|
|
scomplex* temp_c;
|
|
dcomplex* temp_z;
|
|
|
|
if ( bli_error_checking_is_enabled() )
|
|
bli_obj_create_const_check( value, obj );
|
|
|
|
bli_obj_create( BLIS_CONSTANT, 1, 1, 1, 1, obj );
|
|
|
|
//temp_s = bli_obj_buffer_for_const( BLIS_FLOAT, obj );
|
|
//temp_d = bli_obj_buffer_for_const( BLIS_DOUBLE, obj );
|
|
//temp_c = bli_obj_buffer_for_const( BLIS_SCOMPLEX, obj );
|
|
//temp_z = bli_obj_buffer_for_const( BLIS_DCOMPLEX, obj );
|
|
//temp_i = bli_obj_buffer_for_const( BLIS_INT, obj );
|
|
|
|
bli_dssets( value, 0.0, *temp_s );
|
|
bli_ddsets( value, 0.0, *temp_d );
|
|
bli_dcsets( value, 0.0, *temp_c );
|
|
bli_dzsets( value, 0.0, *temp_z );
|
|
|
|
*temp_i = ( gint_t ) value;
|
|
}
|
|
|
|
//void bli_obj_create_const_copy_of
|
|
(
|
|
obj_t* a,
|
|
obj_t* b
|
|
)
|
|
{
|
|
gint_t* temp_i;
|
|
float* temp_s;
|
|
double* temp_d;
|
|
scomplex* temp_c;
|
|
dcomplex* temp_z;
|
|
void* buf_a;
|
|
dcomplex value;
|
|
|
|
if ( bli_error_checking_is_enabled() )
|
|
bli_obj_create_const_copy_of_check( a, b );
|
|
|
|
bli_obj_create( BLIS_CONSTANT, 1, 1, 1, 1, b );
|
|
|
|
//temp_s = bli_obj_buffer_for_const( BLIS_FLOAT, b );
|
|
//temp_d = bli_obj_buffer_for_const( BLIS_DOUBLE, b );
|
|
//temp_c = bli_obj_buffer_for_const( BLIS_SCOMPLEX, b );
|
|
//temp_z = bli_obj_buffer_for_const( BLIS_DCOMPLEX, b );
|
|
//temp_i = bli_obj_buffer_for_const( BLIS_INT, b );
|
|
|
|
buf_a = bli_obj_buffer_at_off( a );
|
|
|
|
bli_zzsets( 0.0, 0.0, value );
|
|
|
|
if ( bli_obj_is_float( a ) )
|
|
{
|
|
bli_szcopys( *(( float* )buf_a), value );
|
|
}
|
|
else if ( bli_obj_is_double( a ) )
|
|
{
|
|
bli_dzcopys( *(( double* )buf_a), value );
|
|
}
|
|
else if ( bli_obj_is_scomplex( a ) )
|
|
{
|
|
bli_czcopys( *(( scomplex* )buf_a), value );
|
|
}
|
|
else if ( bli_obj_is_dcomplex( a ) )
|
|
{
|
|
bli_zzcopys( *(( dcomplex* )buf_a), value );
|
|
}
|
|
else
|
|
{
|
|
bli_check_error_code( BLIS_NOT_YET_IMPLEMENTED );
|
|
}
|
|
|
|
bli_zscopys( value, *temp_s );
|
|
bli_zdcopys( value, *temp_d );
|
|
bli_zccopys( value, *temp_c );
|
|
bli_zzcopys( value, *temp_z );
|
|
|
|
*temp_i = ( gint_t ) bli_zreal( value );
|
|
}
|
|
#endif
|
|
|
|
void bli_adjust_strides
|
|
(
|
|
dim_t m,
|
|
dim_t n,
|
|
siz_t elem_size,
|
|
inc_t* rs,
|
|
inc_t* cs,
|
|
inc_t* is
|
|
)
|
|
{
|
|
// Here, we check the strides that were input from the user and modify
|
|
// them if needed.
|
|
|
|
// Handle the special "empty" case first. If either dimension is zero,
|
|
// do nothing (this could represent a zero-length "slice" of another
|
|
// matrix).
|
|
if ( m == 0 || n == 0 ) return;
|
|
|
|
// Interpret rs = cs = 0 as request for column storage.
|
|
if ( *rs == 0 && *cs == 0 && ( *is == 0 || *is == 1 ) )
|
|
{
|
|
// First we handle the 1x1 scalar case explicitly.
|
|
if ( m == 1 && n == 1 )
|
|
{
|
|
*rs = 1;
|
|
*cs = 1;
|
|
}
|
|
// We use column-major storage, except when m == 1, because we don't
|
|
// want both strides to be unit.
|
|
else if ( m == 1 && n > 1 )
|
|
{
|
|
*rs = n;
|
|
*cs = 1;
|
|
}
|
|
else
|
|
{
|
|
*rs = 1;
|
|
*cs = m;
|
|
}
|
|
|
|
// Use default complex storage.
|
|
*is = 1;
|
|
|
|
// Align the strides depending on the tilt of the matrix. Note that
|
|
// scalars are neither row nor column tilted. Also note that alignment
|
|
// is only done for rs = cs = 0, and any user-supplied row and column
|
|
// strides are preserved.
|
|
if ( bli_is_col_tilted( m, n, *rs, *cs ) )
|
|
{
|
|
*cs = bli_align_dim_to_size( *cs, elem_size,
|
|
BLIS_HEAP_STRIDE_ALIGN_SIZE );
|
|
}
|
|
else if ( bli_is_row_tilted( m, n, *rs, *cs ) )
|
|
{
|
|
*rs = bli_align_dim_to_size( *rs, elem_size,
|
|
BLIS_HEAP_STRIDE_ALIGN_SIZE );
|
|
}
|
|
}
|
|
else if ( *rs == 1 && *cs == 1 )
|
|
{
|
|
// If both strides are unit, this is probably a "lazy" request for a
|
|
// single vector (but could also be a request for a 1xn matrix in
|
|
// column-major order or an mx1 matrix in row-major order). In BLIS,
|
|
// we have decided to "reserve" the case where rs = cs = 1 for
|
|
// 1x1 scalars only.
|
|
if ( m > 1 && n == 1 )
|
|
{
|
|
// Set the column stride to indicate that this is a column vector
|
|
// stored in column-major order. This is done for legacy reasons,
|
|
// because we at one time we had to satisify the error checking
|
|
// in the underlying BLAS library, which expects the leading
|
|
// dimension to be set to at least m, even if it will never be
|
|
// used for indexing since it is a vector and thus only has one
|
|
// column of data.
|
|
*cs = m;
|
|
}
|
|
else if ( m == 1 && n > 1 )
|
|
{
|
|
// Set the row stride to indicate that this is a row vector stored
|
|
// in row-major order.
|
|
*rs = n;
|
|
}
|
|
|
|
// Nothing needs to be done for the 1x1 scalar case where m == n == 1.
|
|
}
|
|
}
|
|
|
|
static siz_t dt_sizes[6] =
|
|
{
|
|
sizeof( float ),
|
|
sizeof( scomplex ),
|
|
sizeof( double ),
|
|
sizeof( dcomplex ),
|
|
sizeof( gint_t ),
|
|
sizeof( constdata_t )
|
|
};
|
|
|
|
siz_t bli_dt_size
|
|
(
|
|
num_t dt
|
|
)
|
|
{
|
|
if ( bli_error_checking_is_enabled() )
|
|
bli_dt_size_check( dt );
|
|
|
|
return dt_sizes[dt];
|
|
}
|
|
|
|
static char* dt_names[ BLIS_NUM_FP_TYPES+1 ] =
|
|
{
|
|
"float",
|
|
"scomplex",
|
|
"double",
|
|
"dcomplex",
|
|
"int"
|
|
};
|
|
|
|
char* bli_dt_string
|
|
(
|
|
num_t dt
|
|
)
|
|
{
|
|
if ( bli_error_checking_is_enabled() )
|
|
bli_dt_string_check( dt );
|
|
|
|
return dt_names[dt];
|
|
}
|
|
|
|
dim_t bli_align_dim_to_mult
|
|
(
|
|
dim_t dim,
|
|
dim_t dim_mult
|
|
)
|
|
{
|
|
// We return the dimension unmodified if the multiple is zero
|
|
// (to avoid division by zero).
|
|
if ( dim_mult == 0 ) return dim;
|
|
|
|
dim = ( ( dim + dim_mult - 1 ) /
|
|
dim_mult ) *
|
|
dim_mult;
|
|
|
|
return dim;
|
|
}
|
|
|
|
dim_t bli_align_dim_to_size
|
|
(
|
|
dim_t dim,
|
|
siz_t elem_size,
|
|
siz_t align_size
|
|
)
|
|
{
|
|
dim = ( ( dim * ( dim_t )elem_size +
|
|
( dim_t )align_size - 1
|
|
) /
|
|
( dim_t )align_size
|
|
) *
|
|
( dim_t )align_size /
|
|
( dim_t )elem_size;
|
|
|
|
return dim;
|
|
}
|
|
|
|
dim_t bli_align_ptr_to_size
|
|
(
|
|
void* p,
|
|
size_t align_size
|
|
)
|
|
{
|
|
dim_t dim;
|
|
|
|
dim = ( ( ( uintptr_t )p + align_size - 1 ) /
|
|
align_size
|
|
) * align_size;
|
|
|
|
return dim;
|
|
}
|
|
|
|
#if 0
|
|
static num_t type_union[BLIS_NUM_FP_TYPES][BLIS_NUM_FP_TYPES] =
|
|
{
|
|
// s c d z
|
|
/* s */ { BLIS_FLOAT, BLIS_SCOMPLEX, BLIS_DOUBLE, BLIS_DCOMPLEX },
|
|
/* c */ { BLIS_SCOMPLEX, BLIS_SCOMPLEX, BLIS_DCOMPLEX, BLIS_DCOMPLEX },
|
|
/* d */ { BLIS_DOUBLE, BLIS_DCOMPLEX, BLIS_DOUBLE, BLIS_DCOMPLEX },
|
|
/* z */ { BLIS_DCOMPLEX, BLIS_DCOMPLEX, BLIS_DCOMPLEX, BLIS_DCOMPLEX }
|
|
};
|
|
|
|
num_t bli_dt_union( num_t dt1, num_t dt2 )
|
|
{
|
|
if ( bli_error_checking_is_enabled() )
|
|
bli_dt_union_check( dt1, dt2 );
|
|
|
|
return type_union[dt1][dt2];
|
|
}
|
|
#endif
|
|
|
|
void bli_obj_print
|
|
(
|
|
char* label,
|
|
obj_t* obj
|
|
)
|
|
{
|
|
bli_init_once();
|
|
|
|
FILE* file = stdout;
|
|
|
|
if ( bli_error_checking_is_enabled() )
|
|
bli_obj_print_check( label, obj );
|
|
|
|
fprintf( file, "\n" );
|
|
fprintf( file, "%s\n", label );
|
|
fprintf( file, "\n" );
|
|
|
|
fprintf( file, " m x n %lu x %lu\n", ( unsigned long int )bli_obj_length( obj ),
|
|
( unsigned long int )bli_obj_width( obj ) );
|
|
fprintf( file, "\n" );
|
|
|
|
fprintf( file, " offm, offn %lu, %lu\n", ( unsigned long int )bli_obj_row_off( obj ),
|
|
( unsigned long int )bli_obj_col_off( obj ) );
|
|
fprintf( file, " diagoff %ld\n", ( signed long int )bli_obj_diag_offset( obj ) );
|
|
fprintf( file, "\n" );
|
|
|
|
fprintf( file, " buf %p\n", ( void* )bli_obj_buffer( obj ) );
|
|
fprintf( file, " elem size %lu\n", ( unsigned long int )bli_obj_elem_size( obj ) );
|
|
fprintf( file, " rs, cs %ld, %ld\n", ( signed long int )bli_obj_row_stride( obj ),
|
|
( signed long int )bli_obj_col_stride( obj ) );
|
|
fprintf( file, " is %ld\n", ( signed long int )bli_obj_imag_stride( obj ) );
|
|
fprintf( file, " m_padded %lu\n", ( unsigned long int )bli_obj_padded_length( obj ) );
|
|
fprintf( file, " n_padded %lu\n", ( unsigned long int )bli_obj_padded_width( obj ) );
|
|
fprintf( file, " pd %lu\n", ( unsigned long int )bli_obj_panel_dim( obj ) );
|
|
fprintf( file, " ps %lu\n", ( unsigned long int )bli_obj_panel_stride( obj ) );
|
|
fprintf( file, "\n" );
|
|
|
|
fprintf( file, " info %lX\n", ( unsigned long int )(*obj).info );
|
|
fprintf( file, " - is complex %lu\n", ( unsigned long int )bli_obj_is_complex( obj ) );
|
|
fprintf( file, " - is d. prec %lu\n", ( unsigned long int )bli_obj_is_double_prec( obj ) );
|
|
fprintf( file, " - datatype %lu\n", ( unsigned long int )bli_obj_dt( obj ) );
|
|
fprintf( file, " - target dt %lu\n", ( unsigned long int )bli_obj_target_dt( obj ) );
|
|
fprintf( file, " - exec dt %lu\n", ( unsigned long int )bli_obj_exec_dt( obj ) );
|
|
fprintf( file, " - has trans %lu\n", ( unsigned long int )bli_obj_has_trans( obj ) );
|
|
fprintf( file, " - has conj %lu\n", ( unsigned long int )bli_obj_has_conj( obj ) );
|
|
fprintf( file, " - unit diag? %lu\n", ( unsigned long int )bli_obj_has_unit_diag( obj ) );
|
|
fprintf( file, " - struc type %lu\n", ( unsigned long int )bli_obj_struc( obj ) >> BLIS_STRUC_SHIFT );
|
|
fprintf( file, " - uplo type %lu\n", ( unsigned long int )bli_obj_uplo( obj ) >> BLIS_UPLO_SHIFT );
|
|
fprintf( file, " - is upper %lu\n", ( unsigned long int )bli_obj_is_upper( obj ) );
|
|
fprintf( file, " - is lower %lu\n", ( unsigned long int )bli_obj_is_lower( obj ) );
|
|
fprintf( file, " - is dense %lu\n", ( unsigned long int )bli_obj_is_dense( obj ) );
|
|
fprintf( file, " - pack schema %lu\n", ( unsigned long int )bli_obj_pack_schema( obj ) >> BLIS_PACK_SCHEMA_SHIFT );
|
|
fprintf( file, " - packinv diag? %lu\n", ( unsigned long int )bli_obj_has_inverted_diag( obj ) );
|
|
fprintf( file, " - pack ordifup %lu\n", ( unsigned long int )bli_obj_is_pack_rev_if_upper( obj ) );
|
|
fprintf( file, " - pack ordiflo %lu\n", ( unsigned long int )bli_obj_is_pack_rev_if_lower( obj ) );
|
|
fprintf( file, " - packbuf type %lu\n", ( unsigned long int )bli_obj_pack_buffer_type( obj ) >> BLIS_PACK_BUFFER_SHIFT );
|
|
fprintf( file, "\n" );
|
|
}
|
|
|