mirror of
https://github.com/amd/blis.git
synced 2026-05-04 22:41:11 +00:00
Details:
- Removed explicit reference to The University of Texas at Austin in the
third clause of the license comment blocks of all relevant files and
replaced it with a more all-encompassing "copyright holder(s)".
- Removed duplicate words ("derived") from a few kernels' license
comment blocks.
- Homogenized license comment block in kernels/zen/3/bli_gemm_small.c
with format of all other comment blocks.
156 lines
4.5 KiB
C
156 lines
4.5 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(s) of the copyright holder(s) 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_zgemm_template_noopt
|
|
(
|
|
dim_t k,
|
|
dcomplex* restrict alpha,
|
|
dcomplex* restrict a1,
|
|
dcomplex* restrict b1,
|
|
dcomplex* restrict beta,
|
|
dcomplex* restrict c11, inc_t rs_c, inc_t cs_c,
|
|
auxinfo_t* restrict data,
|
|
cntx_t* restrict cntx
|
|
)
|
|
{
|
|
/*
|
|
Template gemm micro-kernel implementation
|
|
|
|
This function contains a template implementation for a double-precision
|
|
complex micro-kernel, coded in C, which can serve as the starting point for
|
|
one to write an optimized micro-kernel on an arbitrary architecture. (We
|
|
show a template implementation for only double-precision complex because
|
|
the templates for the other three floating-point types would be nearly
|
|
identical.)
|
|
|
|
This micro-kernel performs a matrix-matrix multiplication of the form:
|
|
|
|
C11 := beta * C11 + alpha * A1 * B1
|
|
|
|
where A1 is MR x k, B1 is k x NR, C11 is MR x NR, and alpha and beta are
|
|
scalars.
|
|
|
|
For more info, please refer to the BLIS website's wiki on kernels:
|
|
|
|
https://github.com/flame/blis/wiki/KernelsHowTo
|
|
|
|
and/or contact the blis-devel mailing list.
|
|
|
|
-FGVZ
|
|
*/
|
|
const num_t dt = BLIS_DCOMPLEX;
|
|
|
|
const dim_t mr = bli_cntx_get_blksz_def_dt( dt, BLIS_MR, cntx );
|
|
const dim_t nr = bli_cntx_get_blksz_def_dt( dt, BLIS_NR, cntx );
|
|
|
|
const inc_t packmr = bli_cntx_get_blksz_max_dt( dt, BLIS_MR, cntx );
|
|
const inc_t packnr = bli_cntx_get_blksz_max_dt( dt, BLIS_NR, cntx );
|
|
|
|
const inc_t cs_a = packmr;
|
|
const inc_t rs_b = packnr;
|
|
|
|
const inc_t rs_ab = 1;
|
|
const inc_t cs_ab = mr;
|
|
|
|
dim_t l, j, i;
|
|
|
|
dcomplex ab[ bli_zmr *
|
|
bli_znr ];
|
|
dcomplex* abij;
|
|
dcomplex ai, bj;
|
|
|
|
|
|
/* Initialize the accumulator elements in ab to zero. */
|
|
for ( i = 0; i < mr * nr; ++i )
|
|
{
|
|
bli_zset0s( *(ab + i) );
|
|
}
|
|
|
|
/* Perform a series of k rank-1 updates into ab. */
|
|
for ( l = 0; l < k; ++l )
|
|
{
|
|
abij = ab;
|
|
|
|
/* In an optimized implementation, these two loops over MR and NR
|
|
are typically fully unrolled. */
|
|
for ( j = 0; j < nr; ++j )
|
|
{
|
|
bj = *(b1 + j);
|
|
|
|
for ( i = 0; i < mr; ++i )
|
|
{
|
|
ai = *(a1 + i);
|
|
|
|
bli_zdots( ai, bj, *abij );
|
|
|
|
abij += rs_ab;
|
|
}
|
|
}
|
|
|
|
a1 += cs_a;
|
|
b1 += rs_b;
|
|
}
|
|
|
|
/* Scale each element of ab by alpha. */
|
|
for ( i = 0; i < mr * nr; ++i )
|
|
{
|
|
bli_zscals( *alpha, *(ab + i) );
|
|
}
|
|
|
|
/* If beta is zero, overwrite c11 with the scaled result in ab.
|
|
Otherwise, scale c11 by beta and then add the scaled result in
|
|
ab. */
|
|
if ( bli_zeq0( *beta ) )
|
|
{
|
|
/* c11 := ab */
|
|
bli_zcopys_mxn( mr,
|
|
nr,
|
|
ab, rs_ab, cs_ab,
|
|
c11, rs_c, cs_c );
|
|
}
|
|
else
|
|
{
|
|
/* c11 := beta * c11 + ab */
|
|
bli_zxpbys_mxn( mr,
|
|
nr,
|
|
ab, rs_ab, cs_ab,
|
|
beta,
|
|
c11, rs_c, cs_c );
|
|
}
|
|
}
|
|
|