mirror of
https://github.com/amd/blis.git
synced 2026-04-30 04:21:12 +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.
362 lines
9.8 KiB
C
362 lines
9.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"
|
|
|
|
//
|
|
// Define BLAS-like interfaces with typed operands.
|
|
//
|
|
|
|
#undef GENTFUNC
|
|
#define GENTFUNC( ctype, ch, opname, kername, kerid ) \
|
|
\
|
|
void PASTEMAC(ch,opname) \
|
|
( \
|
|
doff_t diagoffx, \
|
|
diag_t diagx, \
|
|
trans_t transx, \
|
|
dim_t m, \
|
|
dim_t n, \
|
|
ctype* x, inc_t rs_x, inc_t cs_x, \
|
|
ctype* y, inc_t rs_y, inc_t cs_y, \
|
|
cntx_t* cntx \
|
|
) \
|
|
{ \
|
|
bli_init_once(); \
|
|
\
|
|
const num_t dt = PASTEMAC(ch,type); \
|
|
\
|
|
ctype* x1; \
|
|
ctype* y1; \
|
|
conj_t conjx; \
|
|
dim_t n_elem; \
|
|
dim_t offx, offy; \
|
|
inc_t incx, incy; \
|
|
\
|
|
if ( bli_zero_dim2( m, n ) ) return; \
|
|
\
|
|
if ( bli_is_outside_diag( diagoffx, transx, m, n ) ) return; \
|
|
\
|
|
/* Determine the distance to the diagonals, the number of diagonal
|
|
elements, and the diagonal increments. */ \
|
|
bli_set_dims_incs_2d( diagoffx, transx, \
|
|
m, n, rs_x, cs_x, rs_y, cs_y, \
|
|
offx, offy, n_elem, incx, incy ); \
|
|
\
|
|
conjx = bli_extract_conj( transx ); \
|
|
\
|
|
if ( bli_is_nonunit_diag( diagx ) ) \
|
|
{ \
|
|
x1 = x + offx; \
|
|
y1 = y + offy; \
|
|
} \
|
|
else /* if ( bli_is_unit_diag( diagx ) ) */ \
|
|
{ \
|
|
/* Simulate a unit diagonal for x with a zero increment over a unit
|
|
scalar. */ \
|
|
x1 = PASTEMAC(ch,1); \
|
|
incx = 0; \
|
|
y1 = y + offy; \
|
|
} \
|
|
\
|
|
/* Obtain a valid context from the gks if necessary. */ \
|
|
if ( cntx == NULL ) cntx = bli_gks_query_cntx(); \
|
|
\
|
|
/* Query the context for the operation's kernel address. */ \
|
|
PASTECH2(ch,kername,_ft) f = bli_cntx_get_l1v_ker_dt( dt, kerid, cntx ); \
|
|
\
|
|
/* Invoke the kernel with the appropriate parameters. */ \
|
|
f( \
|
|
conjx, \
|
|
n_elem, \
|
|
x1, incx, \
|
|
y1, incy, \
|
|
cntx \
|
|
); \
|
|
}
|
|
|
|
INSERT_GENTFUNC_BASIC2( addd, addv, BLIS_ADDV_KER )
|
|
INSERT_GENTFUNC_BASIC2( copyd, copyv, BLIS_COPYV_KER )
|
|
INSERT_GENTFUNC_BASIC2( subd, subv, BLIS_SUBV_KER )
|
|
|
|
|
|
#undef GENTFUNC
|
|
#define GENTFUNC( ctype, ch, opname, kername, kerid ) \
|
|
\
|
|
void PASTEMAC(ch,opname) \
|
|
( \
|
|
doff_t diagoffx, \
|
|
diag_t diagx, \
|
|
trans_t transx, \
|
|
dim_t m, \
|
|
dim_t n, \
|
|
ctype* alpha, \
|
|
ctype* x, inc_t rs_x, inc_t cs_x, \
|
|
ctype* y, inc_t rs_y, inc_t cs_y, \
|
|
cntx_t* cntx \
|
|
) \
|
|
{ \
|
|
bli_init_once(); \
|
|
\
|
|
const num_t dt = PASTEMAC(ch,type); \
|
|
\
|
|
ctype* x1; \
|
|
ctype* y1; \
|
|
conj_t conjx; \
|
|
dim_t n_elem; \
|
|
dim_t offx, offy; \
|
|
inc_t incx, incy; \
|
|
\
|
|
if ( bli_zero_dim2( m, n ) ) return; \
|
|
\
|
|
if ( bli_is_outside_diag( diagoffx, transx, m, n ) ) return; \
|
|
\
|
|
/* Determine the distance to the diagonals, the number of diagonal
|
|
elements, and the diagonal increments. */ \
|
|
bli_set_dims_incs_2d( diagoffx, transx, \
|
|
m, n, rs_x, cs_x, rs_y, cs_y, \
|
|
offx, offy, n_elem, incx, incy ); \
|
|
\
|
|
conjx = bli_extract_conj( transx ); \
|
|
\
|
|
if ( bli_is_nonunit_diag( diagx ) ) \
|
|
{ \
|
|
x1 = x + offx; \
|
|
y1 = y + offy; \
|
|
} \
|
|
else /* if ( bli_is_unit_diag( diagx ) ) */ \
|
|
{ \
|
|
/* Simulate a unit diagonal for x with a zero increment over a unit
|
|
scalar. */ \
|
|
x1 = PASTEMAC(ch,1); \
|
|
incx = 0; \
|
|
y1 = y + offy; \
|
|
} \
|
|
\
|
|
/* Obtain a valid context from the gks if necessary. */ \
|
|
if ( cntx == NULL ) cntx = bli_gks_query_cntx(); \
|
|
\
|
|
/* Query the context for the operation's kernel address. */ \
|
|
PASTECH2(ch,kername,_ft) f = bli_cntx_get_l1v_ker_dt( dt, kerid, cntx ); \
|
|
\
|
|
/* Invoke the kernel with the appropriate parameters. */ \
|
|
f( \
|
|
conjx, \
|
|
n_elem, \
|
|
alpha, \
|
|
x1, incx, \
|
|
y1, incy, \
|
|
cntx \
|
|
); \
|
|
}
|
|
|
|
INSERT_GENTFUNC_BASIC2( axpyd, axpyv, BLIS_AXPYV_KER )
|
|
INSERT_GENTFUNC_BASIC2( scal2d, scal2v, BLIS_SCAL2V_KER )
|
|
|
|
|
|
#undef GENTFUNC
|
|
#define GENTFUNC( ctype, ch, opname, kername, kerid ) \
|
|
\
|
|
void PASTEMAC(ch,opname) \
|
|
( \
|
|
doff_t diagoffx, \
|
|
dim_t m, \
|
|
dim_t n, \
|
|
ctype* x, inc_t rs_x, inc_t cs_x, \
|
|
cntx_t* cntx \
|
|
) \
|
|
{ \
|
|
bli_init_once(); \
|
|
\
|
|
const num_t dt = PASTEMAC(ch,type); \
|
|
\
|
|
ctype* x1; \
|
|
dim_t n_elem; \
|
|
dim_t offx; \
|
|
inc_t incx; \
|
|
\
|
|
if ( bli_zero_dim2( m, n ) ) return; \
|
|
\
|
|
if ( bli_is_outside_diag( diagoffx, BLIS_NO_TRANSPOSE, m, n ) ) return; \
|
|
\
|
|
/* Determine the distance to the diagonals, the number of diagonal
|
|
elements, and the diagonal increments. */ \
|
|
bli_set_dims_incs_1d( diagoffx, \
|
|
m, n, rs_x, cs_x, \
|
|
offx, n_elem, incx ); \
|
|
\
|
|
x1 = x + offx; \
|
|
\
|
|
/* Obtain a valid context from the gks if necessary. */ \
|
|
if ( cntx == NULL ) cntx = bli_gks_query_cntx(); \
|
|
\
|
|
/* Query the context for the operation's kernel address. */ \
|
|
PASTECH2(ch,kername,_ft) f = bli_cntx_get_l1v_ker_dt( dt, kerid, cntx ); \
|
|
\
|
|
/* Invoke the kernel with the appropriate parameters. */ \
|
|
f( \
|
|
n_elem, \
|
|
x1, incx, \
|
|
cntx \
|
|
); \
|
|
}
|
|
|
|
INSERT_GENTFUNC_BASIC2( invertd, invertv, BLIS_INVERTV_KER )
|
|
|
|
|
|
#undef GENTFUNC
|
|
#define GENTFUNC( ctype, ch, opname, kername, kerid ) \
|
|
\
|
|
void PASTEMAC(ch,opname) \
|
|
( \
|
|
conj_t conjalpha, \
|
|
doff_t diagoffx, \
|
|
dim_t m, \
|
|
dim_t n, \
|
|
ctype* alpha, \
|
|
ctype* x, inc_t rs_x, inc_t cs_x, \
|
|
cntx_t* cntx \
|
|
) \
|
|
{ \
|
|
bli_init_once(); \
|
|
\
|
|
const num_t dt = PASTEMAC(ch,type); \
|
|
\
|
|
ctype* x1; \
|
|
dim_t n_elem; \
|
|
dim_t offx; \
|
|
inc_t incx; \
|
|
\
|
|
if ( bli_zero_dim2( m, n ) ) return; \
|
|
\
|
|
if ( bli_is_outside_diag( diagoffx, BLIS_NO_TRANSPOSE, m, n ) ) return; \
|
|
\
|
|
/* Determine the distance to the diagonals, the number of diagonal
|
|
elements, and the diagonal increments. */ \
|
|
bli_set_dims_incs_1d( diagoffx, \
|
|
m, n, rs_x, cs_x, \
|
|
offx, n_elem, incx ); \
|
|
\
|
|
x1 = x + offx; \
|
|
\
|
|
/* Obtain a valid context from the gks if necessary. */ \
|
|
if ( cntx == NULL ) cntx = bli_gks_query_cntx(); \
|
|
\
|
|
/* Query the context for the operation's kernel address. */ \
|
|
PASTECH2(ch,kername,_ft) f = bli_cntx_get_l1v_ker_dt( dt, kerid, cntx ); \
|
|
\
|
|
/* Invoke the kernel with the appropriate parameters. */ \
|
|
f( \
|
|
conjalpha, \
|
|
n_elem, \
|
|
alpha, \
|
|
x1, incx, \
|
|
cntx \
|
|
); \
|
|
}
|
|
|
|
INSERT_GENTFUNC_BASIC2( scald, scalv, BLIS_SCALV_KER )
|
|
INSERT_GENTFUNC_BASIC2( setd, setv, BLIS_SETV_KER )
|
|
|
|
|
|
#undef GENTFUNCR
|
|
#define GENTFUNCR( ctype, ctype_r, ch, chr, opname, kername, kerid ) \
|
|
\
|
|
void PASTEMAC(ch,opname) \
|
|
( \
|
|
doff_t diagoffx, \
|
|
dim_t m, \
|
|
dim_t n, \
|
|
ctype_r* alpha, \
|
|
ctype* x, inc_t rs_x, inc_t cs_x, \
|
|
cntx_t* cntx \
|
|
) \
|
|
{ \
|
|
bli_init_once(); \
|
|
\
|
|
const num_t dt = PASTEMAC(ch,type); \
|
|
const num_t dt_r = PASTEMAC(chr,type); \
|
|
\
|
|
ctype_r* x1; \
|
|
dim_t n_elem; \
|
|
dim_t offx; \
|
|
inc_t incx; \
|
|
\
|
|
/* If the datatype is real, the entire operation is a no-op. */ \
|
|
if ( bli_is_real( dt ) ) return; \
|
|
\
|
|
if ( bli_zero_dim2( m, n ) ) return; \
|
|
\
|
|
if ( bli_is_outside_diag( diagoffx, BLIS_NO_TRANSPOSE, m, n ) ) return; \
|
|
\
|
|
/* Determine the distance to the diagonals, the number of diagonal
|
|
elements, and the diagonal increments. */ \
|
|
bli_set_dims_incs_1d( diagoffx, \
|
|
m, n, rs_x, cs_x, \
|
|
offx, n_elem, incx ); \
|
|
\
|
|
/* Alternate implementation. (Substitute for remainder of function). */ \
|
|
/* for ( i = 0; i < n_elem; ++i ) \
|
|
{ \
|
|
ctype* chi11 = x1 + (i )*incx; \
|
|
\
|
|
PASTEMAC(ch,setis)( *alpha, *chi11 ); \
|
|
} */ \
|
|
\
|
|
/* Acquire the addres of the imaginary component of the first element,
|
|
and scale the increment for use in the real domain. Note that the
|
|
indexing into the imaginary field only needs to work for complex
|
|
datatypes since we return early for real domain types. */ \
|
|
x1 = ( ctype_r* )( x + offx ) + 1; \
|
|
incx = 2*incx; \
|
|
\
|
|
/* Obtain a valid context from the gks if necessary. */ \
|
|
if ( cntx == NULL ) cntx = bli_gks_query_cntx(); \
|
|
\
|
|
/* Query the context for the operation's kernel address. */ \
|
|
PASTECH2(chr,kername,_ft) f = bli_cntx_get_l1v_ker_dt( dt_r, kerid, cntx ); \
|
|
\
|
|
/* Invoke the kernel with the appropriate parameters. */ \
|
|
f( \
|
|
BLIS_NO_CONJUGATE, \
|
|
n_elem, \
|
|
alpha, \
|
|
x1, incx, \
|
|
cntx \
|
|
); \
|
|
}
|
|
|
|
INSERT_GENTFUNCR_BASIC2( setid, setv, BLIS_SETV_KER )
|
|
|