mirror of
https://github.com/amd/blis.git
synced 2026-04-19 15:18:52 +00:00
107 lines
2.9 KiB
C
107 lines
2.9 KiB
C
/*
|
|
|
|
BLIS
|
|
An object-based framework for developing high-performance BLAS-like
|
|
libraries.
|
|
|
|
Copyright (C) 2014, The University of Texas at Austin
|
|
Copyright (C) 2020, Advanced Micro Devices, Inc. All rights reserved.
|
|
|
|
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"
|
|
|
|
#undef GENTFUNC
|
|
#define GENTFUNC( ctype, ch, opname, arch, suf ) \
|
|
\
|
|
void PASTEMAC3(ch,opname,arch,suf) \
|
|
( \
|
|
conj_t conjx, \
|
|
dim_t n, \
|
|
ctype* restrict x, inc_t incx, \
|
|
ctype* restrict y, inc_t incy, \
|
|
cntx_t* restrict cntx \
|
|
) \
|
|
{ \
|
|
AOCL_DTL_TRACE_ENTRY(AOCL_DTL_LEVEL_TRACE_3) \
|
|
\
|
|
if ( bli_zero_dim1( n ) ) \
|
|
{ \
|
|
AOCL_DTL_TRACE_EXIT(AOCL_DTL_LEVEL_TRACE_3) \
|
|
return; \
|
|
} \
|
|
\
|
|
if ( bli_is_conj( conjx ) ) \
|
|
{ \
|
|
if ( incx == 1 && incy == 1 ) \
|
|
{ \
|
|
PRAGMA_SIMD \
|
|
for ( dim_t i = 0; i < n; ++i ) \
|
|
{ \
|
|
PASTEMAC(ch,copyjs)( x[i], y[i] ); \
|
|
} \
|
|
} \
|
|
else \
|
|
{ \
|
|
for ( dim_t i = 0; i < n; ++i ) \
|
|
{ \
|
|
PASTEMAC(ch,copyjs)( *x, *y ); \
|
|
\
|
|
x += incx; \
|
|
y += incy; \
|
|
} \
|
|
} \
|
|
} \
|
|
else \
|
|
{ \
|
|
if ( incx == 1 && incy == 1 ) \
|
|
{ \
|
|
PRAGMA_SIMD \
|
|
for ( dim_t i = 0; i < n; ++i ) \
|
|
{ \
|
|
PASTEMAC(ch,copys)( x[i], y[i] ); \
|
|
} \
|
|
} \
|
|
else \
|
|
{ \
|
|
for ( dim_t i = 0; i < n; ++i ) \
|
|
{ \
|
|
PASTEMAC(ch,copys)( *x, *y ); \
|
|
\
|
|
x += incx; \
|
|
y += incy; \
|
|
} \
|
|
} \
|
|
} \
|
|
\
|
|
AOCL_DTL_TRACE_EXIT(AOCL_DTL_LEVEL_TRACE_3) \
|
|
\
|
|
}
|
|
|
|
INSERT_GENTFUNC_BASIC2( copyv, BLIS_CNAME_INFIX, BLIS_REF_SUFFIX )
|
|
|