87b3d9054f
SAXPY built with OpenXL regresses when compared to SAXPY built with gcc. OpenXL compiler doesn't know that the SAXPY inner kernel assembly is a 64 element loop and to it the remainder loop is the main loop. It vectorizes and interleaves the remainder to be a 48 elements per iteration loop. With a max of 63 iterations, a 48 element loop is mostly not going to get executed, so the 1 element scalar loop that is the remainder after that is probably mostly what gets executed. This can be fixed by adding a pragma, loop interleave_count(2) which will result in 8 element loop. Signed-off-by: Amrita H S <amritahs@linux.vnet.ibm.com>
129 lines
3.3 KiB
C
129 lines
3.3 KiB
C
/***************************************************************************
|
|
Copyright (c) 2020, The OpenBLAS Project
|
|
All rights reserved.
|
|
Redistribution and use in source and binary forms, with or without
|
|
modification, are permitted provided that the following conditions are
|
|
met:
|
|
1. Redistributions of source code must retain the above copyright
|
|
notice, this list of conditions and the following disclaimer.
|
|
2. 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.
|
|
3. Neither the name of the OpenBLAS project 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 OPENBLAS PROJECT 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 "common.h"
|
|
|
|
#if defined(__VEC__) || defined(__ALTIVEC__)
|
|
#include "saxpy_microk_power10.c"
|
|
#endif
|
|
|
|
#ifndef HAVE_KERNEL_8
|
|
static void saxpy_kernel_64(BLASLONG n, FLOAT *x, FLOAT *y, FLOAT alpha)
|
|
{
|
|
BLASLONG register i = 0;
|
|
|
|
while(i < n)
|
|
{
|
|
y[i] += alpha * x[i];
|
|
y[i+1] += alpha * x[i+1];
|
|
y[i+2] += alpha * x[i+2];
|
|
y[i+3] += alpha * x[i+3];
|
|
y[i+4] += alpha * x[i+4];
|
|
y[i+5] += alpha * x[i+5];
|
|
y[i+6] += alpha * x[i+6];
|
|
y[i+7] += alpha * x[i+7];
|
|
i+=8 ;
|
|
|
|
}
|
|
|
|
}
|
|
#endif
|
|
|
|
int CNAME(BLASLONG n, BLASLONG dummy0, BLASLONG dummy1, FLOAT da, FLOAT *x, BLASLONG inc_x, FLOAT *y, BLASLONG inc_y, FLOAT *dummy, BLASLONG dummy2)
|
|
{
|
|
BLASLONG i=0;
|
|
BLASLONG ix=0,iy=0;
|
|
|
|
if ( n <= 0 ) return(0);
|
|
|
|
if ( (inc_x == 1) && (inc_y == 1) )
|
|
{
|
|
|
|
if ( n >= 64 )
|
|
{
|
|
BLASLONG align = ((32 - ((uintptr_t)x & (uintptr_t)0x1F)) >> 2) & 0x7;
|
|
for (i = 0; i < align; i++) {
|
|
y[i] += da * x[i] ;
|
|
}
|
|
}
|
|
BLASLONG n1 = (n-i) & -64;
|
|
if ( n1 )
|
|
saxpy_kernel_64(n1, &x[i], &y[i], da);
|
|
|
|
i += n1;
|
|
#if defined(__clang__)
|
|
#pragma clang loop interleave_count(2)
|
|
#endif
|
|
while(i < n)
|
|
{
|
|
|
|
y[i] += da * x[i] ;
|
|
i++ ;
|
|
|
|
}
|
|
return(0);
|
|
|
|
|
|
}
|
|
|
|
BLASLONG n1 = n & -4;
|
|
|
|
while(i < n1)
|
|
{
|
|
|
|
FLOAT m1 = da * x[ix] ;
|
|
FLOAT m2 = da * x[ix+inc_x] ;
|
|
FLOAT m3 = da * x[ix+2*inc_x] ;
|
|
FLOAT m4 = da * x[ix+3*inc_x] ;
|
|
|
|
y[iy] += m1 ;
|
|
y[iy+inc_y] += m2 ;
|
|
y[iy+2*inc_y] += m3 ;
|
|
y[iy+3*inc_y] += m4 ;
|
|
|
|
ix += inc_x*4 ;
|
|
iy += inc_y*4 ;
|
|
i+=4 ;
|
|
|
|
}
|
|
|
|
while(i < n)
|
|
{
|
|
|
|
y[iy] += da * x[ix] ;
|
|
ix += inc_x ;
|
|
iy += inc_y ;
|
|
i++ ;
|
|
|
|
}
|
|
return(0);
|
|
|
|
}
|
|
|
|
|