amd/blis
1
0
Fork 0
mirror of https://github.com/amd/blis.git synced 2026-04-20 07:38:53 +00:00
Code Issues Packages Projects Releases Wiki Activity
Files
537a1f4f85ce1aa008901857cb3182e6b4546d7f
blis/config/template/bli_kernel.h
Field G. Van Zee 537a1f4f85 Implemented runtime contexts and reorganized code. 
Details:
- Retrofitted a new data structure, known as a context, into virtually
  all internal APIs for computational operations in BLIS. The structure
  is now present within the type-aware APIs, as well as many supporting
  utility functions that require information stored in the context. User-
  level object APIs were unaffected and continue to be "context-free,"
  however, these APIs were duplicated/mirrored so that "context-aware"
  APIs now also exist, differentiated with an "_ex" suffix (for "expert").
  These new context-aware object APIs (along with the lower-level, type-
  aware, BLAS-like APIs) contain the the address of a context as a last
  parameter, after all other operands. Contexts, or specifically, cntx_t
  object pointers, are passed all the way down the function stack into
  the kernels and allow the code at any level to query information about
  the runtime, such as kernel addresses and blocksizes, in a thread-
  friendly manner--that is, one that allows thread-safety, even if the
  original source of the information stored in the context changes at
  run-time; see next bullet for more on this "original source" of info).
  (Special thanks go to Lee Killough for suggesting the use of this kind
  of data structure in discussions that transpired during the early
  planning stages of BLIS, and also for suggesting such a perfectly
  appropriate name.)
- Added a new API, in frame/base/bli_gks.c, to define a "global kernel
  structure" (gks). This data structure and API will allow the caller to
  initialize a context with the kernel addresses, blocksizes, and other
  information associated with the currently active kernel configuration.
  The currently active kernel configuration within the gks cannot be
  changed (for now), and is initialized with the traditional cpp macros
  that define kernel function names, blocksizes, and the like. However,
  in the future, the gks API will be expanded to allow runtime management
  of kernels and runtime parameters. The most obvious application of this
  new infrastructure is the runtime detection of hardware (and the
  implied selection of appropriate kernels). With contexts in place,
  kernels may even be "hot swapped" at runtime within the gks. Once
  execution enters a level-3 _front() function, the memory allocator will
  be reinitialized on-the-fly, if necessary, to accommodate the new
  kernels' blocksizes. If another application thread is executing with
  another (previously loaded) kernel, it will finish in a deterministic
  fashion because its kernel information was loaded into its context
  before computation began, and also because the blocks it checked out
  from the internal memory pools will be unaffected by the newer threads'
  reinitialization of the allocator.
- Reorganized and streamlined the 'ind' directory, which contains much of
  the code enabling use of induced methods for complex domain matrix
  multiplication; deprecated bli_bsv_query.c and bli_ukr_query.c, as
  those APIs' functionality is now mostly subsumed within the global
  kernel structure.
- Updated bli_pool.c to define a new function, bli_pool_reinit_if(),
  that will reinitialize a memory pool if the necessary pool block size
  has increased.
- Updated bli_mem.c to use bli_pool_reinit_if() instead of
  bli_pool_reinit() in the definition of bli_mem_pool_init(), and placed
  usage of contexts where appropriate to communicate cache and register
  blocksizes to bli_mem_compute_pool_block_sizes().
- Simplified control trees now that much of the information resides in
  the context and/or the global kernel structure:
  - Removed blocksize object pointers (blksz_t*) fields from all control
    tree node definitions and replaced them with blocksize id (bszid_t)
    values instead, which may be passed into a context query routine in
    order to extract the corresponding blocksize from the given context.
  - Removed micro-kernel function pointers (func_t*) fields from all
    control tree node definitions. Now, any code that needs these function
    pointers can query them from the local context, as identified by a
    level-3 micro-kernel id (l3ukr_t), level-1f kernel id, (l1fkr_t), or
    level-1v kernel id (l1vkr_t).
  - Removed blksz_t object creation and initialization, as well as kernel
    function object creation and initialization, from all operation-
    specific control tree initialization files (bli_*_cntl.c), since this
    information will now live in the gks and, secondarily, in the context.
- Removed blocksize multiples from blksz_t objects. Now, we track
  blocksize multiples for each blocksize id (bszid_t) in the context
  object.
- Removed the bool_t's that were required when a func_t was initialized.
  These bools are meant to allow one to track the micro-kernel's storage
  preferences (by rows or columns). This preference is now tracked
  separately within the gks and contexts.
- Merged and reorganized many separate-but-related functions into single
  files. This reorganization affects frame/0, 1, 1d, 1m, 1f, 2, 3, and
  util directories, but has the most obvious effect of allowing BLIS
  to compile noticeably faster.
- Reorganized execution paths for level-1v, -1d, -1m, and -2 operations
  in an attempt to reduce overhead for memory-bound operations. This
  includes removal of default use of object-based variants for level-2
  operations. Now, by default, level-2 operations will directly call a
  low-level (non-object based) loop over a level-1v or -1f kernel.
- Converted many common query functions in blk_blksz.c (renamed from
  bli_blocksize.c) and bli_func.c into cpp macros, now defined in their
  respective header files.
- Defined bli_mbool.c API to create and query "multi-bools", or
  heterogeneous bool_t's (one for each floating-point datatype), in the
  same spirit as blksz_t and func_t.
- Introduced two key parameters of the hardware: BLIS_SIMD_NUM_REGISTERS
  and BLIS_SIMD_SIZE. These values are needed in order to compute a third
  new parameter, which may be set indirectly via the aforementioned
  macros or directly: BLIS_STACK_BUF_MAX_SIZE. This value is used to
  statically allocate memory in macro-kernels and the induced methods'
  virtual kernels to be used as temporary space to hold a single
  micro-tile. These values are now output by the testsuite. The default
  value of BLIS_STACK_BUF_MAX_SIZE is computed as
  "2 * BLIS_SIMD_NUM_REGISTERS * BLIS_SIMD_SIZE".
- Cleaned up top-level 'kernels' directory (for example, renaming the
  embarrassingly misleading "avx" and "avx2" directories to "sandybridge"
  and "haswell," respectively, and gave more consistent and meaningful
  names to many kernel files (as well as updating their interfaces to
  conform to the new context-aware kernel APIs).
- Updated the testsuite to query blocksizes from a locally-initialized
  context for test modules that need those values: axpyf, dotxf,
  dotxaxpyf, gemm_ukr, gemmtrsm_ukr, and trsm_ukr.
- Reformatted many function signatures into a standard format that will
  more easily facilitate future API-wide changes.
- Updated many "mxn" level-0 macros (ie: those used to inline double loops
  for level-1m-like operations on small matrices) in frame/include/level0
  to use more obscure local variable names in an effort to avoid variable
  shaddowing. (Thanks to Devin Matthews for pointing these gcc warnings,
  which are only output using -Wshadow.)
- Added a conj argument to setm, so that its interface now mirrors that
  of scalm. The semantic meaning of the conj argument is to optionally
  allow implicit conjugation of the scalar prior to being populated into
  the object.
- Deprecated all type-aware mixed domain and mixed precision APIs. Note
  that this does not preclude supporting mixed types via the object APIs,
  where it produces absolutely zero API code bloat.
2016-04-11 17:21:28 -05:00

378 lines
14 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.
*/
#ifndef BLIS_KERNEL_H
#define BLIS_KERNEL_H
// -- LEVEL-3 MICRO-KERNEL CONSTANTS -------------------------------------------
// -- Cache blocksizes --
// Constraints:
//
// (1) MC must be a multiple of:
// (a) MR (for zero-padding purposes)
// (b) NR (for zero-padding purposes when MR and NR are "swapped")
// (2) NC must be a multiple of
// (a) NR (for zero-padding purposes)
// (b) MR (for zero-padding purposes when MR and NR are "swapped")
#define BLIS_DEFAULT_MC_S 128
#define BLIS_DEFAULT_KC_S 256
#define BLIS_DEFAULT_NC_S 2048
#define BLIS_DEFAULT_MC_D 128
#define BLIS_DEFAULT_KC_D 256
#define BLIS_DEFAULT_NC_D 2048
#define BLIS_DEFAULT_MC_C 128
#define BLIS_DEFAULT_KC_C 256
#define BLIS_DEFAULT_NC_C 2048
#define BLIS_DEFAULT_MC_Z 128
#define BLIS_DEFAULT_KC_Z 256
#define BLIS_DEFAULT_NC_Z 2048
// -- Register blocksizes --
#define BLIS_DEFAULT_MR_S 8
#define BLIS_DEFAULT_NR_S 4
#define BLIS_DEFAULT_MR_D 8
#define BLIS_DEFAULT_NR_D 4
#define BLIS_DEFAULT_MR_C 8
#define BLIS_DEFAULT_NR_C 4
#define BLIS_DEFAULT_MR_Z 8
#define BLIS_DEFAULT_NR_Z 4
// NOTE: If the micro-kernel, which is typically unrolled to a factor
// of f, handles leftover edge cases (ie: when k % f > 0) then these
// register blocksizes in the k dimension can be defined to 1.
//#define BLIS_DEFAULT_KR_S 1
//#define BLIS_DEFAULT_KR_D 1
//#define BLIS_DEFAULT_KR_C 1
//#define BLIS_DEFAULT_KR_Z 1
// -- Maximum cache blocksizes (for optimizing edge cases) --
// NOTE: These cache blocksize "extensions" have the same constraints as
// the corresponding default blocksizes above. When these values are
// larger than the default blocksizes, blocksizes used at edge cases are
// enlarged if such an extension would encompass the remaining portion of
// the matrix dimension.
//#define BLIS_MAXIMUM_MC_S (BLIS_DEFAULT_MC_S + BLIS_DEFAULT_MC_S/4)
//#define BLIS_MAXIMUM_KC_S (BLIS_DEFAULT_KC_S + BLIS_DEFAULT_KC_S/4)
//#define BLIS_MAXIMUM_NC_S (BLIS_DEFAULT_NC_S + BLIS_DEFAULT_NC_S/4)
//#define BLIS_MAXIMUM_MC_D (BLIS_DEFAULT_MC_D + BLIS_DEFAULT_MC_D/4)
//#define BLIS_MAXIMUM_KC_D (BLIS_DEFAULT_KC_D + BLIS_DEFAULT_KC_D/4)
//#define BLIS_MAXIMUM_NC_D (BLIS_DEFAULT_NC_D + BLIS_DEFAULT_NC_D/4)
//#define BLIS_MAXIMUM_MC_C (BLIS_DEFAULT_MC_C + BLIS_DEFAULT_MC_C/4)
//#define BLIS_MAXIMUM_KC_C (BLIS_DEFAULT_KC_C + BLIS_DEFAULT_KC_C/4)
//#define BLIS_MAXIMUM_NC_C (BLIS_DEFAULT_NC_C + BLIS_DEFAULT_NC_C/4)
//#define BLIS_MAXIMUM_MC_Z (BLIS_DEFAULT_MC_Z + BLIS_DEFAULT_MC_Z/4)
//#define BLIS_MAXIMUM_KC_Z (BLIS_DEFAULT_KC_Z + BLIS_DEFAULT_KC_Z/4)
//#define BLIS_MAXIMUM_NC_Z (BLIS_DEFAULT_NC_Z + BLIS_DEFAULT_NC_Z/4)
// -- Packing register blocksize (for packed micro-panels) --
// NOTE: These register blocksize "extensions" determine whether the
// leading dimensions used within the packed micro-panels are equal to
// or greater than their corresponding register blocksizes above.
//#define BLIS_PACKDIM_MR_S (BLIS_DEFAULT_MR_S + ...)
//#define BLIS_PACKDIM_NR_S (BLIS_DEFAULT_NR_S + ...)
//#define BLIS_PACKDIM_MR_D (BLIS_DEFAULT_MR_D + ...)
//#define BLIS_PACKDIM_NR_D (BLIS_DEFAULT_NR_D + ...)
//#define BLIS_PACKDIM_MR_C (BLIS_DEFAULT_MR_C + ...)
//#define BLIS_PACKDIM_NR_C (BLIS_DEFAULT_NR_C + ...)
//#define BLIS_PACKDIM_MR_Z (BLIS_DEFAULT_MR_Z + ...)
//#define BLIS_PACKDIM_NR_Z (BLIS_DEFAULT_NR_Z + ...)
// -- LEVEL-3 MICRO-KERNELS ---------------------------------------------------
// -- gemm --
#define BLIS_SGEMM_UKERNEL bli_sgemm_opt_mxn
#define BLIS_DGEMM_UKERNEL bli_dgemm_opt_mxn
#define BLIS_CGEMM_UKERNEL bli_cgemm_opt_mxn
#define BLIS_ZGEMM_UKERNEL bli_zgemm_opt_mxn
// -- trsm-related --
#define BLIS_SGEMMTRSM_L_UKERNEL bli_sgemmtrsm_l_opt_mxn
#define BLIS_DGEMMTRSM_L_UKERNEL bli_dgemmtrsm_l_opt_mxn
#define BLIS_CGEMMTRSM_L_UKERNEL bli_cgemmtrsm_l_opt_mxn
#define BLIS_ZGEMMTRSM_L_UKERNEL bli_zgemmtrsm_l_opt_mxn
#define BLIS_SGEMMTRSM_U_UKERNEL bli_sgemmtrsm_u_opt_mxn
#define BLIS_DGEMMTRSM_U_UKERNEL bli_dgemmtrsm_u_opt_mxn
#define BLIS_CGEMMTRSM_U_UKERNEL bli_cgemmtrsm_u_opt_mxn
#define BLIS_ZGEMMTRSM_U_UKERNEL bli_zgemmtrsm_u_opt_mxn
#define BLIS_STRSM_L_UKERNEL bli_strsm_l_opt_mxn
#define BLIS_DTRSM_L_UKERNEL bli_dtrsm_l_opt_mxn
#define BLIS_CTRSM_L_UKERNEL bli_ctrsm_l_opt_mxn
#define BLIS_ZTRSM_L_UKERNEL bli_ztrsm_l_opt_mxn
#define BLIS_STRSM_U_UKERNEL bli_strsm_u_opt_mxn
#define BLIS_DTRSM_U_UKERNEL bli_dtrsm_u_opt_mxn
#define BLIS_CTRSM_U_UKERNEL bli_ctrsm_u_opt_mxn
#define BLIS_ZTRSM_U_UKERNEL bli_ztrsm_u_opt_mxn
// -- LEVEL-2 KERNEL CONSTANTS -------------------------------------------------
// NOTE: These values determine high-level cache blocking for level-2
// operations ONLY. So, if gemv is performed with a 2000x2000 matrix A and
// MC = NC = 1000, then a total of four unblocked (or unblocked fused)
// gemv subproblems are called. The blocked algorithms are only useful in
// that they provide the opportunity for packing vectors. (Matrices can also
// be packed here, but this tends to be much too expensive in practice to
// actually employ.)
//#define BLIS_DEFAULT_M2_S 1000
//#define BLIS_DEFAULT_N2_S 1000
//#define BLIS_DEFAULT_M2_D 1000
//#define BLIS_DEFAULT_N2_D 1000
//#define BLIS_DEFAULT_M2_C 1000
//#define BLIS_DEFAULT_N2_C 1000
//#define BLIS_DEFAULT_M2_Z 1000
//#define BLIS_DEFAULT_N2_Z 1000
// -- LEVEL-1F KERNEL CONSTANTS ------------------------------------------------
// -- Default fusing factors for level-1f operations --
//#define BLIS_DEFAULT_1F_S 8
//#define BLIS_DEFAULT_1F_D 4
//#define BLIS_DEFAULT_1F_C 4
//#define BLIS_DEFAULT_1F_Z 2
//#define BLIS_DEFAULT_AF_S BLIS_DEFAULT_1F_S
//#define BLIS_DEFAULT_AF_D BLIS_DEFAULT_1F_D
//#define BLIS_DEFAULT_AF_C BLIS_DEFAULT_1F_C
//#define BLIS_DEFAULT_AF_Z BLIS_DEFAULT_1F_Z
//#define BLIS_DEFAULT_DF_S BLIS_DEFAULT_1F_S
//#define BLIS_DEFAULT_DF_D BLIS_DEFAULT_1F_D
//#define BLIS_DEFAULT_DF_C BLIS_DEFAULT_1F_C
//#define BLIS_DEFAULT_DF_Z BLIS_DEFAULT_1F_Z
//#define BLIS_DEFAULT_XF_S BLIS_DEFAULT_1F_S
//#define BLIS_DEFAULT_XF_D BLIS_DEFAULT_1F_D
//#define BLIS_DEFAULT_XF_C BLIS_DEFAULT_1F_C
//#define BLIS_DEFAULT_XF_Z BLIS_DEFAULT_1F_Z
// -- LEVEL-1F KERNEL DEFINITIONS ----------------------------------------------
// -- axpy2v --
#define BLIS_SAXPY2V_KERNEL bli_saxpy2v_opt_var1
#define BLIS_DAXPY2V_KERNEL bli_daxpy2v_opt_var1
#define BLIS_CAXPY2V_KERNEL bli_caxpy2v_opt_var1
#define BLIS_ZAXPY2V_KERNEL bli_zaxpy2v_opt_var1
// -- dotaxpyv --
#define BLIS_SDOTAXPYV_KERNEL bli_sdotaxpyv_opt_var1
#define BLIS_DDOTAXPYV_KERNEL bli_ddotaxpyv_opt_var1
#define BLIS_CDOTAXPYV_KERNEL bli_cdotaxpyv_opt_var1
#define BLIS_ZDOTAXPYV_KERNEL bli_zdotaxpyv_opt_var1
// -- axpyf --
#define BLIS_SAXPYF_KERNEL bli_saxpyf_opt_var1
#define BLIS_DAXPYF_KERNEL bli_daxpyf_opt_var1
#define BLIS_CAXPYF_KERNEL bli_caxpyf_opt_var1
#define BLIS_ZAXPYF_KERNEL bli_zaxpyf_opt_var1
// -- dotxf --
#define BLIS_SDOTXF_KERNEL bli_sdotxf_opt_var1
#define BLIS_DDOTXF_KERNEL bli_ddotxf_opt_var1
#define BLIS_CDOTXF_KERNEL bli_cdotxf_opt_var1
#define BLIS_ZDOTXF_KERNEL bli_zdotxf_opt_var1
// -- dotxaxpyf --
#define BLIS_SDOTXAXPYF_KERNEL bli_sdotxaxpyf_opt_var1
#define BLIS_DDOTXAXPYF_KERNEL bli_ddotxaxpyf_opt_var1
#define BLIS_CDOTXAXPYF_KERNEL bli_cdotxaxpyf_opt_var1
#define BLIS_ZDOTXAXPYF_KERNEL bli_zdotxaxpyf_opt_var1
// -- LEVEL-1M KERNEL DEFINITIONS ----------------------------------------------
// -- packm --
//#define BLIS_SPACKM_2XK_KERNEL bli_spackm_ref_2xk
//#define BLIS_DPACKM_2XK_KERNEL bli_dpackm_ref_2xk
//#define BLIS_CPACKM_2XK_KERNEL bli_cpackm_ref_2xk
//#define BLIS_ZPACKM_2XK_KERNEL bli_zpackm_ref_2xk
//#define BLIS_SPACKM_4XK_KERNEL bli_spackm_ref_4xk
//#define BLIS_DPACKM_4XK_KERNEL bli_dpackm_ref_4xk
//#define BLIS_CPACKM_4XK_KERNEL bli_cpackm_ref_4xk
//#define BLIS_ZPACKM_4XK_KERNEL bli_zpackm_ref_4xk
//#define BLIS_SPACKM_6XK_KERNEL bli_spackm_ref_6xk
//#define BLIS_DPACKM_6XK_KERNEL bli_dpackm_ref_6xk
//#define BLIS_CPACKM_6XK_KERNEL bli_cpackm_ref_6xk
//#define BLIS_ZPACKM_6XK_KERNEL bli_zpackm_ref_6xk
//#define BLIS_SPACKM_8XK_KERNEL bli_spackm_ref_8xk
//#define BLIS_DPACKM_8XK_KERNEL bli_dpackm_ref_8xk
//#define BLIS_CPACKM_8XK_KERNEL bli_cpackm_ref_8xk
//#define BLIS_ZPACKM_8XK_KERNEL bli_zpackm_ref_8xk
// ...
// (Commented definitions for 10, 12, 14, and 16 not shown).
// -- LEVEL-1V KERNEL DEFINITIONS ----------------------------------------------
// -- addv --
//#define BLIS_SADDV_KERNEL bli_saddv_unb_var1
//#define BLIS_DADDV_KERNEL bli_daddv_unb_var1
//#define BLIS_CADDV_KERNEL bli_caddv_unb_var1
//#define BLIS_ZADDV_KERNEL bli_zaddv_unb_var1
// -- axpyv --
#define BLIS_SAXPYV_KERNEL bli_saxpyv_opt_var1
#define BLIS_DAXPYV_KERNEL bli_daxpyv_opt_var1
#define BLIS_CAXPYV_KERNEL bli_caxpyv_opt_var1
#define BLIS_ZAXPYV_KERNEL bli_zaxpyv_opt_var1
// -- copyv --
//#define BLIS_SCOPYV_KERNEL bli_scopyv_unb_var1
//#define BLIS_DCOPYV_KERNEL bli_dcopyv_unb_var1
//#define BLIS_CCOPYV_KERNEL bli_ccopyv_unb_var1
//#define BLIS_ZCOPYV_KERNEL bli_zcopyv_unb_var1
// -- dotv --
#define BLIS_SDOTV_KERNEL bli_sdotv_opt_var1
#define BLIS_DDOTV_KERNEL bli_ddotv_opt_var1
#define BLIS_CDOTV_KERNEL bli_cdotv_opt_var1
#define BLIS_ZDOTV_KERNEL bli_zdotv_opt_var1
// -- dotxv --
//#define BLIS_SDOTXV_KERNEL bli_sdotxv_unb_var1
//#define BLIS_DDOTXV_KERNEL bli_ddotxv_unb_var1
//#define BLIS_CDOTXV_KERNEL bli_cdotxv_unb_var1
//#define BLIS_ZDOTXV_KERNEL bli_zdotxv_unb_var1
// -- invertv --
//#define BLIS_SINVERTV_KERNEL bli_sinvertv_unb_var1
//#define BLIS_DINVERTV_KERNEL bli_dinvertv_unb_var1
//#define BLIS_CINVERTV_KERNEL bli_cinvertv_unb_var1
//#define BLIS_ZINVERTV_KERNEL bli_zinvertv_unb_var1
// -- scal2v --
//#define BLIS_SSCAL2V_KERNEL bli_sscal2v_unb_var1
//#define BLIS_DSCAL2V_KERNEL bli_dscal2v_unb_var1
//#define BLIS_CSCAL2V_KERNEL bli_cscal2v_unb_var1
//#define BLIS_ZSCAL2V_KERNEL bli_zscal2v_unb_var1
// -- scalv --
//#define BLIS_SSCALV_KERNEL bli_sscalv_unb_var1
//#define BLIS_DSCALV_KERNEL bli_dscalv_unb_var1
//#define BLIS_CSCALV_KERNEL bli_cscalv_unb_var1
//#define BLIS_ZSCALV_KERNEL bli_zscalv_unb_var1
// -- setv --
//#define BLIS_SSETV_KERNEL bli_ssetv_unb_var1
//#define BLIS_DSETV_KERNEL bli_dsetv_unb_var1
//#define BLIS_CSETV_KERNEL bli_csetv_unb_var1
//#define BLIS_ZSETV_KERNEL bli_zsetv_unb_var1
// -- subv --
//#define BLIS_SSUBV_KERNEL bli_ssubv_unb_var1
//#define BLIS_DSUBV_KERNEL bli_dsubv_unb_var1
//#define BLIS_CSUBV_KERNEL bli_csubv_unb_var1
//#define BLIS_ZSUBV_KERNEL bli_zsubv_unb_var1
// -- swapv --
//#define BLIS_SSWAPV_KERNEL bli_sswapv_unb_var1
//#define BLIS_DSWAPV_KERNEL bli_dswapv_unb_var1
//#define BLIS_CSWAPV_KERNEL bli_cswapv_unb_var1
//#define BLIS_ZSWAPV_KERNEL bli_zswapv_unb_var1
#endif
Reference in New Issue View Git Blame Copy Permalink