Files
blis/frame/2/her2/bli_her2_unb_var4.c
Field G. Van Zee 4b36e85be9 Converted function-like macros to static functions.
Details:
- Converted most C preprocessor macros in bli_param_macro_defs.h and
  bli_obj_macro_defs.h to static functions.
- Reshuffled some functions/macros to bli_misc_macro_defs.h and also
  between bli_param_macro_defs.h and bli_obj_macro_defs.h.
- Changed obj_t-initializing macros in bli_type_defs.h to static
  functions.
- Removed some old references to BLIS_TWO and BLIS_MINUS_TWO from
  bli_constants.h.
- Whitespace changes in select files (four spaces to single tab).
2018-05-08 14:26:30 -05:00

178 lines
5.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 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"
#undef GENTFUNC
#define GENTFUNC( ctype, ch, varname ) \
\
void PASTEMAC(ch,varname) \
( \
uplo_t uplo, \
conj_t conjx, \
conj_t conjy, \
conj_t conjh, \
dim_t m, \
ctype* alpha, \
ctype* x, inc_t incx, \
ctype* y, inc_t incy, \
ctype* c, inc_t rs_c, inc_t cs_c, \
cntx_t* cntx \
) \
{ \
const num_t dt = PASTEMAC(ch,type); \
\
ctype* chi1; \
ctype* x2; \
ctype* psi1; \
ctype* y2; \
ctype* gamma11; \
ctype* c21; \
ctype alpha0; \
ctype alpha1; \
ctype alpha0_psi1; \
ctype alpha1_chi1; \
ctype alpha0_chi1_psi1; \
ctype conjy0_psi1; \
ctype conjx1_chi1; \
ctype conjx0_chi1; \
dim_t i; \
dim_t n_ahead; \
inc_t rs_ct, cs_ct; \
conj_t conj0, conj1; \
conj_t conjh_conjx; \
conj_t conjh_conjy; \
\
/* Eliminate unused variable warnings. */ \
( void )conjh_conjx; \
( void )conjh_conjy; \
\
/* The algorithm will be expressed in terms of the lower triangular case;
the upper triangular case is supported by swapping the row and column
strides of A and toggling some conj parameters. */ \
if ( bli_is_lower( uplo ) ) \
{ \
rs_ct = rs_c; \
cs_ct = cs_c; \
\
PASTEMAC(ch,copys)( *alpha, alpha0 ); \
PASTEMAC(ch,copycjs)( conjh, *alpha, alpha1 ); \
} \
else /* if ( bli_is_upper( uplo ) ) */ \
{ \
rs_ct = cs_c; \
cs_ct = rs_c; \
\
/* Toggle conjugation of conjx/conjy, but only if we are being invoked
as her2; for syr2, conjx/conjy are unchanged. */ \
conjx = bli_apply_conj( conjh, conjx ); \
conjy = bli_apply_conj( conjh, conjy ); \
\
PASTEMAC(ch,copycjs)( conjh, *alpha, alpha0 ); \
PASTEMAC(ch,copys)( *alpha, alpha1 ); \
} \
\
/* Apply conjh (which carries the conjugation component of the Hermitian
transpose, if applicable) to conjx and/or conjy as needed to arrive at
the effective conjugation for the vector subproblems. */ \
conj0 = conjx; \
conj1 = conjy; \
conjh_conjx = bli_apply_conj( conjh, conjx ); \
conjh_conjy = bli_apply_conj( conjh, conjy ); \
\
PASTECH(ch,axpyv_ft) kfp_av; \
\
/* Query the context for the kernel function pointer. */ \
kfp_av = bli_cntx_get_l1v_ker_dt( dt, BLIS_AXPYV_KER, cntx ); \
\
for ( i = 0; i < m; ++i ) \
{ \
n_ahead = m - i - 1; \
chi1 = x + (i )*incx; \
x2 = x + (i+1)*incx; \
psi1 = y + (i )*incy; \
y2 = y + (i+1)*incy; \
gamma11 = c + (i )*rs_ct + (i )*cs_ct; \
c21 = c + (i+1)*rs_ct + (i )*cs_ct; \
\
/* Apply conjx and/or conjy to chi1 and/or psi1. */ \
PASTEMAC(ch,copycjs)( conjh_conjy, *psi1, conjy0_psi1 ); \
PASTEMAC(ch,copycjs)( conjh_conjx, *chi1, conjx1_chi1 ); \
PASTEMAC(ch,copycjs)( conj0, *chi1, conjx0_chi1 ); \
\
/* Compute scalars for vector subproblems. */ \
PASTEMAC(ch,scal2s)( alpha0, conjy0_psi1, alpha0_psi1 ); \
PASTEMAC(ch,scal2s)( alpha1, conjx1_chi1, alpha1_chi1 ); \
\
/* Compute alpha * chi1 * conj(psi1) after both chi1 and psi1 have
already been conjugated, if needed, by conjx and conjy. */ \
PASTEMAC(ch,scal2s)( alpha0_psi1, conjx0_chi1, alpha0_chi1_psi1 ); \
\
/* c21 = c21 + alpha * x2 * conj(psi1); */ \
kfp_av \
( \
conj0, \
n_ahead, \
&alpha0_psi1, \
x2, incx, \
c21, rs_ct, \
cntx \
); \
\
/* c21 = c21 + conj(alpha) * y2 * conj(chi1); */ \
kfp_av \
( \
conj1, \
n_ahead, \
&alpha1_chi1, \
y2, incy, \
c21, rs_ct, \
cntx \
); \
\
/* gamma11 = gamma11 + alpha * chi1 * conj(psi1) \
+ conj(alpha) * psi1 * conj(chi1); */ \
PASTEMAC(ch,adds)( alpha0_chi1_psi1, *gamma11 ); \
PASTEMAC(ch,adds)( alpha0_chi1_psi1, *gamma11 ); \
\
/* For her2, explicitly set the imaginary component of gamma11 to
zero. */ \
if ( bli_is_conj( conjh ) ) \
PASTEMAC(ch,seti0s)( *gamma11 ); \
} \
}
INSERT_GENTFUNC_BASIC0( her2_unb_var4 )